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