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