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)
AIM
pKiss
RNAhybrid
XenDB
BiBiServ policies
Statuscodes
PoSSuMsearch
OMA
RNAsifter
RNAforester
Wotd
Trace2PS
TCRProfiler
Welcome
AggloIndel
REPuter
CG-CAT
genefisher2
mmfind
ADP
GUUGle
Welcome
license
pknotsRG
Rose
PREdictor
Welcome
Intronserter
SciBrow
Wotd
jPREdictor
Dialign
AGT-SDP
Bellman's GAP Cafe
GEvolutionS
MGA
Locomotif
DCJ
ROCOCO
Download
WebService Linklist
Phase4
Download
TALP
mkESA
Metrans
newdist
RNAshapes
Gecko
References
acdc
MoRAine
ClustalW
RapidShapes
privacy policy
JAli
Roci
planACstar
Fly_Pres
dca
PoSSuMsearch2
AGenDA
KnotInFrame
FFGC
Previous Results
SADR
paRNAss
ConCysFind
SWIFT Suit
BiBiServ Team
libfid
Wotd
AltAVist
aCMs
Decomp
References
RNAalishapes
Unwords
SplitsTree
GraphTeams
CEGeD
InSilicoDicer
BPR
Impressum
E2G
SBBI
pAliKiss