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