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