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