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