Pacemaker partition identification

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The universally observed conservation of the distribution of evolution rates across the complete sets of orthologous genes in pairs of related genomes can be explained by the model of the Universal Pacemaker (UPM) of genome evolution. Under UPM, the relative evolutionary rates of all genes remain nearly constant whereas the absolute rates can change arbitrarily. It was shown on several taxa groups spanning the entire tree of life that the UPM model describes the evolutionary process better than the traditional molecular clock model [26][25]. Here we extend this analysis and ask: how many pacemakers are there and which genes are affected by which pacemakers? The answer to this question induces a partition of the gene set such that all the genes in one part are affected by the same pacemaker. The input to the problem comes with arbitrary amount of statistical noise, hindering the solution even more. In this work we devise a novel heuristic procedure, relying on statistical and geometrical tools, to solve the pacemaker partition identification problem and demonstrate by simulation that this approach can cope satisfactorily with considerable noise and realistic problem sizes. We applied this procedure to a set of over 2000 genes in 100 prokaryotes and demonstrated the significant existence of two pacemakers. © 2014 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Snir, S. (2014). Pacemaker partition identification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8701 LNBI, pp. 281–295). Springer Verlag. https://doi.org/10.1007/978-3-662-44753-6_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free