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