Efficient sorting of genomic permutations by translocation, inversion and block interchange
暂无分享,去创建一个
Richard Friedberg | Oliver Attie | Sophia Yancopoulos | O. Attie | R. Friedberg | Sophia Yancopoulos
[1] Niklas Eriksen,et al. Measuring Genome Divergence in Bacteria: A Case Study Using Chlamydian Data , 2002, Journal of Molecular Evolution.
[2] Anne Bergeron,et al. A very elementary presentation of the Hannenhalli-Pevzner theory , 2005, Discret. Appl. Math..
[3] João Meidanis,et al. AN ALTERNATIVE ALGEBRAIC FORMALISM FOR GENOME REARRANGEMENTS , 2000 .
[4] Steven E Schutzer,et al. Genetic exchange and plasmid transfers in Borrelia burgdorferi sensu stricto revealed by three-way genome comparisons and multilocus sequence typing. , 2004, Proceedings of the National Academy of Sciences of the United States of America.
[5] Z. Dias,et al. Genome rearrangements distance by fusion, fission, and transposition is easy , 2001, Proceedings Eighth Symposium on String Processing and Information Retrieval.
[6] Sridhar Hannenhalli,et al. Polynomial-time Algorithm for Computing Translocation Distance Between Genomes , 1995, Discret. Appl. Math..
[7] J. Palmer,et al. Tricircular mitochondrial genomes of Brassica and Raphanus: reversal of repeat configurations by inversion. , 1986, Nucleic acids research.
[8] Tzvika Hartman,et al. A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions , 2003, CPM.
[9] Vineet Bafna,et al. Sorting by Transpositions , 1998, SIAM J. Discret. Math..
[10] Glenn Tesler,et al. Efficient algorithms for multichromosomal genome rearrangements , 2002, J. Comput. Syst. Sci..
[11] Maria Emilia Telles Walter,et al. Working on the Problem of Sorting by Transpositions on Genome Rearrangements , 2003, CPM.
[12] Alberto Caprara,et al. Sorting by reversals is difficult , 1997, RECOMB '97.
[13] W. Ewens,et al. The chromosome inversion problem , 1982 .
[14] Vineet Bafna,et al. Genome Rearrangements and Sorting by Reversals , 1996, SIAM J. Comput..
[15] Ron Shamir,et al. Two Notes on Genome Rearrangement , 2003, J. Bioinform. Comput. Biol..
[16] 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.
[17] S. Andersson,et al. Dynamics of Gene Order Structures and Genomic Architectures , 2000 .
[18] Benjamin J. Raphael,et al. Reconstructing tumor amplisomes , 2004, ISMB/ECCB.
[19] D. Sankoff,et al. Parametric genome rearrangement. , 1996, Gene.
[20] T. Dobzhansky,et al. Inversions in the Third Chromosome of Wild Races of Drosophila Pseudoobscura, and Their Use in the Study of the History of the Species. , 1936, Proceedings of the National Academy of Sciences of the United States of America.
[21] Chuan Yi Tang,et al. An Efficient Algorithm for Sorting by Block-Interchanges and Its Application to the Evolution of Vibrio Species , 2005, J. Comput. Biol..
[22] João Meidanis,et al. A new approach for approximating the transposition distance , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.
[23] Niklas Eriksen,et al. (1+epsilon)-Approximation of sorting by reversals and transpositions , 2001, Theor. Comput. Sci..
[24] Pavel A. Pevzner,et al. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.
[25] P. Deininger,et al. Mobile Elements in Animal and Plant Genomes , 2002 .
[26] David A. Christie,et al. Sorting Permutations by Block-Interchanges , 1996, Inf. Process. Lett..
[27] 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.
[28] Anne Bergeron. A very elementary presentation of the Hannenhalli-Pevzner theory , 2005, Discret. Appl. Math..
[29] David Sankoff,et al. Edit Distance for Genome Comparison Based on Non-local Operations * 1 Role of Rearrangements in Evolution , .