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