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