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