Pacemaker Partition Identification

作者: Sagi Snir

DOI: 10.1007/978-3-662-44753-6_21

关键词:

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

参考文章(34)
Robert Preis, Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs symposium on theoretical aspects of computer science. pp. 259- 269 ,(1999) , 10.1007/3-540-49116-3_24
Gopal Das Khosla, Connectivity in Graphs ,(1967)
J. B. Kruskal, Nonmetric multidimensional scaling: A numerical method Psychometrika. ,vol. 29, pp. 115- 129 ,(1964) , 10.1007/BF02289694
J. A. Hartigan, M. A. Wong, A K-Means Clustering Algorithm Journal of The Royal Statistical Society Series C-applied Statistics. ,vol. 28, pp. 100- 108 ,(1979) , 10.2307/2346830
C. R. Finden, A. D. Gordon, Obtaining common pruned trees Journal of Classification. ,vol. 2, pp. 255- 276 ,(1985) , 10.1007/BF01908078
Dan Gusfield, Partition-distance: A problem and class of perfect graphs arising in clustering Information Processing Letters. ,vol. 82, pp. 159- 164 ,(2002) , 10.1016/S0020-0190(01)00263-0
Shlomo Moran, Sagi Snir, Convex recolorings of strings and trees: Definitions, hardness results and algorithms Journal of Computer and System Sciences. ,vol. 74, pp. 850- 869 ,(2008) , 10.1016/J.JCSS.2007.10.003
K.V. Mardia, Some properties of clasical multi-dimesional scaling Communications in Statistics-theory and Methods. ,vol. 7, pp. 1233- 1241 ,(1978) , 10.1080/03610927808827707
Robert Tibshirani, Guenther Walther, Trevor Hastie, Estimating the number of clusters in a data set via the gap statistic Journal of The Royal Statistical Society Series B-statistical Methodology. ,vol. 63, pp. 411- 423 ,(2001) , 10.1111/1467-9868.00293