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