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