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