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