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