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