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