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