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