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