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