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