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