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