Login
Logged in as anonymous /
My BiBiServ
/
Logout
Search
?
Navigation
Tools
Alignment
AltAVist
ClustalW
dca
Dialign
E2G
JAli
OMA
PoSSuMsearch
PoSSuMsearch2
SWIFT Suit
Evolutionary Relationships
ConCysFind
Roci
ROCOCO
Rose
SplitsTree
Genome Comparison
AGenDA
AggloIndel
CEGeD
CG-CAT
DCJ
FFGC
Gecko
GEvolutionS
GraphTeams
MGA
newdist
REPuter
SBBI
TCRProfiler
Others
acdc
AGT-SDP
AIM
BPR
Decomp
Fly_Pres
Intronserter
jPREdictor
libfid
Metrans
mkESA
mmfind
MoRAine
Phase4
PREdictor
SciBrow
TALP
Trace2PS
Unwords
Wotd
XenDB
Primer Design
genefisher2
RNA
Shapes Studio
KnotInFrame
pAliKiss
pKiss
pknotsRG
RapidShapes
RNAalishapes
RNAshapes
aCMs
GUUGle
InSilicoDicer
Locomotif
paRNAss
planACstar
RNAforester
RNAhybrid
RNAsifter
Previous Results
Framework/Cloud
Education
Dynamic Programming
ADP
Sequence Analysis
SADR
Administration
BiBiServ policies
BiBiServ Team
Impressum
license
privacy policy
Statuscodes
Wotd
Welcome
Download
References
Authors: S. Kurtz, R. Giegerich, J. Stoye
Wotd is an implementation of the ''lazy'' write-only top-down construction algorithm of suffix trees using a very space-efficient representation.
Users of Wotd are requested to cite :
Giegerich, Robert and Kurtz, Stefan and Stoye, Jens
Efficient implementation of lazy suffix trees
, Software - Practise and Experience, 2003
built on March 4 2015 (1:d0ba4790fd33)
pKiss
RNAforester
Locomotif
Welcome
GEvolutionS
dca
genefisher2
libfid
Bellman's GAP Cafe
BiBiServ policies
XenDB
RapidShapes
ROCOCO
Impressum
GUUGle
MoRAine
SADR
ConCysFind
Unwords
SciBrow
Decomp
AIM
AGenDA
Welcome
SplitsTree
RNAshapes
acdc
TALP
AggloIndel
OMA
ADP
MGA
PoSSuMsearch2
Gecko
Phase4
AGT-SDP
DCJ
newdist
mkESA
CG-CAT
Wotd
SWIFT Suit
BiBiServ Team
BPR
GraphTeams
References
AltAVist
Wotd
CEGeD
Wotd
pknotsRG
Statuscodes
license
paRNAss
pAliKiss
mmfind
SBBI
E2G
TCRProfiler
Download
Metrans
jPREdictor
Rose
Fly_Pres
Trace2PS
FFGC
Download
RNAalishapes
Roci
RNAhybrid
KnotInFrame
WebService Linklist
planACstar
InSilicoDicer
Intronserter
PoSSuMsearch
PREdictor
REPuter
RNAsifter
Previous Results
References
JAli
privacy policy
Welcome
aCMs
ClustalW
Dialign