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