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