Chromosomal breakpoint re-use in the inference of genome sequence rearrangement
暂无分享,去创建一个
[1] J. Nadeau,et al. Lengths of chromosomal segments conserved since divergence of man and mouse. , 1984, Proceedings of the National Academy of Sciences of the United States of America.
[2] W. Ewens,et al. The chromosome inversion problem , 1982 .
[3] David A. Bader,et al. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study , 2001, J. Comput. Biol..
[4] Rick Durrett,et al. Genome rearrangement , 2022 .
[5] Pavel A. Pevzner,et al. Transforming men into mice: the Nadeau-Taylor chromosomal breakage model revisited , 2003, RECOMB '03.
[6] P. Pevzner,et al. Genome rearrangements in mammalian evolution: lessons from human and mouse genomes. , 2003, Genome research.
[7] D. Haussler,et al. Evolution's cauldron: Duplication, deletion, and rearrangement in the mouse and human genomes , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[8] Pavel A. Pevzner,et al. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.
[9] Pavel A. Pevzner,et al. Transforming men into mice (polynomial algorithm for genomic distance problem) , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[10] P. Pevzner,et al. Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[11] Anne Bergeron,et al. A very elementary presentation of the Hannenhalli-Pevzner theory , 2005, Discret. Appl. Math..
[12] Sridhar Hannenhalli,et al. Polynomial-time Algorithm for Computing Translocation Distance Between Genomes , 1995, Discret. Appl. Math..
[13] Anne Bergeron. A very elementary presentation of the Hannenhalli-Pevzner theory , 2005, Discret. Appl. Math..
[14] Glenn Tesler,et al. GRIMM: genome rearrangements web server , 2002, Bioinform..