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