Sciweavers

Share
ALMOB
2008

Fast algorithms for computing sequence distances by exhaustive substring composition

9 years 7 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reconstruction. Such needs are hardly fulfilled by the more traditional measures of sequence similarity and distance, like string edit and gene rearrangement, due to a mixture of epistemological and computational problems. Alternative measures, based on the subword composition of sequences, have emerged in recent years and proved to be both fast and effective in a variety of tested cases. The common denominator of such measures is an underlying information theoretic notion of relative compressibility. Their viability depends critically on computational cost. The present paper describes as a paradigm the extension and efficient implementation of one of the methods in this class. The method is based on the comparison of the frequencies of all subwords in the two input sequences, where frequencies are suitably adjus...
Alberto Apostolico, Olgert Denas
Added 08 Dec 2010
Updated 08 Dec 2010
Type Journal
Year 2008
Where ALMOB
Authors Alberto Apostolico, Olgert Denas
Comments (0)
books