The Complexity of Gene Placement

Journal of Algorithms

Volumn 41, Issue 2, 2001, Pages 225-243

  Goldberg, Leslie Ann ^a   Goldberg, Paul W ^a   Paterson, Mike ^a   Pevzner, Pavel ^b   Sahinalp, Süleyman Cenk ^c   Sweedyk, Elizabeth ^d  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Case Western Reserve University   (United States)

^d HARVEY MUDD COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347786614     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1172     Document Type: Article

References (20)

1. V. Bafna and P. Pevzner, Genome rearrangements and sorting by reversals, SIAM. J. Comput. 25 (1996), 272-289.
2. V. Bafna and P. Pevzner, Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of X chromosome, Mol. Biol. Evol. 12 (1995), 239-246.
3. M. Blanchette, G. Bourque, and D. Sankoff, Breakpoint phylogenies, in "Genome Informatics'97," S. Miyano and T. Tayagi (Eds.), pp. 25-43, Tokyo, Japan, 1997.
4. M. Blanchette and D. Sankoff, The median problem for breakpoint phylogenies, in "COCOON'97," Lecture Notes in Computer Science, No. 1276, pp. 251-263, Springer-Verlag, Berlin/New York 1997.
5. B. DasGupta, T. Jiang, S. Kannan, M. Li, and Z. Sweedyk, On the complexity and approximation of syntenic distance, in "RECOMB'97," pp. 99-108, Assoc. Comput. Mach., New York.
6. S. Hannenhalli and P. A. Pevzner, Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals), J. Assoc. Comput. Mach. 46 (1999), 1-27.
7. S. Hannenhalli and P. A. Pevzner, Transforming men into mice (polynomial algorithm for genomic distance problem), in "36th Annual IEEE Symposium on Foundations of Computer Science," pp. 581-592, 1995.
8. J. Kececioglu and R. Ravi, Of mice and men: Evolutionary distances between genomes under translocation, in "Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 604-613, 1995.
9. J. Kececioglu and D. Sankoff, Exact and approximation algorithms for the inversion distance between two permutations, Algorithmica 13 (1995) 180-210.
10. J. Kececioglu and D. Sankoff, Efficient bounds for oriented chromosome inversion distance in "Combinatorial Pattern Matching, Proc. 5th Annual Symposium (CPM'94), Lecture Notes in Computer Science 807," pp. 307-325, Springer-Verlag, Berlin, 1994.
11. S. Letovsky and M. B. Berlyn, CPROP: A Rule-Based Program for Constructing Genetic Maps, Genomics 12 (1992), 435-446.
12. J. H. Nadeau and B. A. Taylor, Lengths of chromosomal segments conserved since divergence of man and mouse, PNAS 81 (1984), 814-818.
13. P. Nadkarni, Mapmerge: Merge genomic maps, Bioinformatics 14, No. 4 (1998), 310-316.
14. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. System Sci. 43 (1991), 425-440.
15. P. A. Pevzner, "Computional Molecular Biology: An Algorithmic Approach," MIT Press, Cambridge, MA, 2000.
16. D. Sankoff and M. Blanchette, Multiple genome rearrangement, in "RECOMB'98," pp. 243-247, Assoc. Comput. Mach., New York, 1998.
17. D. Sankoff, V. Ferretti, and J. H. Nadeau, Conserved segment identification, J. Comput. Biol. 4, No. 4 (1997), 559-565.
18. D. Sankoff, G. Leduc, N. Antoine, B. Paquin, B. F. Lang, and R. Cedergren, Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome, Proc. Nat. Acad. Sci. USA 89 (1992), 6575-6579.
19. J. C. Venter et al. The sequence of the human genome, Science 291 (2001), 1304-1352.
20. The Genome International Sequencing Consortium, Initial sequencing and analysis of the human genome, Nature 409 (2001), 860-921.