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