On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios
暂无分享,去创建一个
[1] Macha Nikolski,et al. Genome rearrangements: a correct algorithm for optimal capping , 2007, Inf. Process. Lett..
[2] Ron Shamir,et al. Two Notes on Genome Rearrangement , 2003, J. Bioinform. Comput. Biol..
[3] Phil Trinh,et al. Chromosomal Breakpoint Reuse in Genome Sequence Rearrangement , 2005, J. Comput. Biol..
[4] Richard Friedberg,et al. Efficient sorting of genomic permutations by translocation, inversion and block interchange , 2005, Bioinform..
[5] 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.
[6] Glenn Tesler,et al. GRIMM: genome rearrangements web server , 2002, Bioinform..
[7] Vineet Bafna,et al. Genome rearrangements and sorting by reversals , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[8] 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.
[9] Pavel A. Pevzner,et al. Transforming men into mice: the Nadeau-Taylor chromosomal breakage model revisited , 2003, RECOMB '03.
[10] David Sankoff,et al. Edit Distances for Genome Comparisons Based on Non-Local Operations , 1992, CPM.
[11] Jens Stoye,et al. A Unifying View of Genome Rearrangements , 2006, WABI.
[12] Jens Stoye,et al. HP Distance Via Double Cut and Join Distance , 2008, CPM.
[13] Pavel A. Pevzner,et al. Are There Rearrangement Hotspots in the Human Genome? , 2007, PLoS Comput. Biol..
[14] Rita Casadio,et al. Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, WABI.
[15] David Sankoff,et al. Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement , 1995, Algorithmica.
[16] Glenn Tesler,et al. Efficient algorithms for multichromosomal genome rearrangements , 2002, J. Comput. Syst. Sci..