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