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