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