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