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