摘要: In order to apply gene-order rearrangement algorithms the comparison of genome sequences, Pevzner and Tesler bypass gene finding ortholog identification use homologous blocks unannotated sequence as input. The method excludes shorter than a threshold length. Here we investigate possible biases introduced by eliminating short blocks, focusing on notion breakpoint reuse these authors. Analytic simulation methods show that is very sensitive proportion excluded. As pertinent mammalian genomes, this exclusion risks randomizing partially or entirely.
core.ac.uk
liebertonline.com参考文章(14)
Anne Bergeron, A very elementary presentation of the Hannenhalli-Pevzner theory combinatorial pattern matching. ,vol. 146, pp. 134- 145 ,(2005) , 10.1016/J.DAM.2004.04.010
J. H. Nadeau, B. A. Taylor, Lengths of chromosomal segments conserved since divergence of man and mouse. Proceedings of the National Academy of Sciences of the United States of America. ,vol. 81, pp. 814- 818 ,(1984) , 10.1073/PNAS.81.3.814
Pavel Pevzner, Glenn Tesler, Genome rearrangements in mammalian evolution: lessons from human and mouse genomes. Genome Research. ,vol. 13, pp. 37- 45 ,(2003) , 10.1101/GR.757503
Sridhar Hannenhalli, Pavel A. Pevzner, Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals Journal of the ACM. ,vol. 46, pp. 1- 27 ,(1999) , 10.1145/300515.300516
Pavel Pevzner, Glenn Tesler, Transforming men into mice Proceedings of the seventh annual international conference on Computational molecular biology - RECOMB '03. pp. 247- 256 ,(2003) , 10.1145/640075.640108
P. Pevzner, G. Tesler, Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution Proceedings of the National Academy of Sciences of the United States of America. ,vol. 100, pp. 7672- 7677 ,(2003) , 10.1073/PNAS.1330369100
Sridhar Hannenhalli, Polynomial-time algorithm for computing translocation distance between genomes Discrete Applied Mathematics. ,vol. 71, pp. 137- 151 ,(1996) , 10.1016/S0166-218X(96)00061-3
David Sankoff, Phil Trinh, Chromosomal breakpoint re-use in the inference of genome sequence rearrangement research in computational molecular biology. pp. 30- 35 ,(2004) , 10.1145/974614.974619
G.A. Watterson, W.J. Ewens, T.E. Hall, A. Morgan, The chromosome inversion problem Journal of Theoretical Biology. ,vol. 99, pp. 1- 7 ,(1982) , 10.1016/0022-5193(82)90384-8
W. J. Kent, R. Baertsch, A. Hinrichs, W. Miller, D. Haussler, Evolution's cauldron: Duplication, deletion, and rearrangement in the mouse and human genomes Proceedings of the National Academy of Sciences of the United States of America. ,vol. 100, pp. 11484- 11489 ,(2003) , 10.1073/PNAS.1932072100