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