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