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