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