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