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