A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
The Average Common Substring Approach to Phylogenomic Reconstruction
2006
Journal of Computational Biology
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our method is a new measure of pairwise distances between sequences. This measure is based on computing the average lengths of maximum common substrings. It is intrinsically related to information theoretic tools (Kullback-Leibler relative entropy). We present an algorithm for efficiently computing these distances. In
doi:10.1089/cmb.2006.13.336
pmid:16597244
fatcat:l2y4ypheo5bbncforxo55ffqdi