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