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