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