Gene maps linearization using genomic rearrangement distances

Journal of Computational Biology

Volumn 14, Issue 4, 2007, Pages 394-407

  Blin, Guillaume ^a   Blais, Eric ^b   Hermelin, Danny ^c   Guillon, Pierre ^a   Blanchette, Mathieu ^b   El Mabrouk, Nadia ^d  

^a UNIVERSITÉ PARIS EST   (France)

^b MCGILL UNIVERSITY   (Canada)

^c UNIVERSITY OF HAIFA   (Israel)

^d UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Breakpoints; Common interval; Complexity; Gene maps

Indexed keywords

CHROMOSOME MAP; CONFERENCE PAPER; GENE MAPPING; GENE ORDER; GENE REARRANGEMENT; GENE SEQUENCE; GENETIC ALGORITHM; GENOME ANALYSIS; GRASS; LINEAR SYSTEM; MATHEMATICAL COMPUTING; NONHUMAN; PLANT GENETICS; PRIORITY JOURNAL;

ALGORITHMS; COMPUTATIONAL BIOLOGY; GENOME; GENOMICS; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 34250320546     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2007.A002     Document Type: Conference Paper

References (21)

1. Bérard, S., Bergeron, A., and Chauve, C. 2004. Conservation of combinatorial structures in evolution scenarios. Lect. Notes. Comput. Sci. 3388, 1-14.
2. Bergeron, A., Mixtacki, J., and Stoye, J. 2004. Reversal distance without hurdles and fortresses. Lect. Notes. Comput. Sci. 3109, 388-399.
3. Blin, G., Chateau, A., Chauve, C., et al. 2006. Inferring positional homologs with common intervals of sequences. Lect. Notes. Comput. Sci. 4205, 24-38.
4. Blin, G., and Rizzi, R. 2005. Conserved interval distance computation between non-trivial genomes. Lect. Notes. Comput. Sci. 3595, 22-31.
5. Bourque, G., Yacef, Y., and El-Mabrouk, N. 2005a. Maximizing synteny blocks to identify ancestral homologs. Lect. Notes. Comput. Sci. 3678, 21-34.
6. Bourque, G., Zdobnov, E., Bork, P., et al. 2005b. Comparative architectures of mammalian and chicken genomes reveal highly variable rates of genomic rearrangements across different lineages. Genome Res. 15, 98-110.
7. Bowers, J., Abbey, C., Anderson, A., et al. 2003. A high-density genetic recombination map of sequence-tagged sites for Sorghum, as a framework for comparative structural and evolutionary genomics of tropical grains and grasses. Genetics 165, 367-386.
8. El-Mabrouk, N. 2000. Sorting signed permutations by reversals and insertions/deletions of contiguous segments. J. Discrete Algorithms 1, 105-122.
9. Figeac, M., and Varré, J. 2004. Sorting by reversals with common intervals. Lect. Notes Bioinform. 3240, 26-37.
10. Floyd, R.W. 1962. Algorithm 97: shortest path. Commun. ACM 5, 345.
11. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco.
12. Hannenhalli, S., and Pevzner, P.A. 1999. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). J. ACM 48, 1-27.
13. Jackson, B., Alum, S., and Schnable, P. 2005. Consensus genetic maps: a graph theory approach. IEEE Comput. Syst. Bioinform. Conf., 35-43.
14. Lander, S., Green, P., Abrahamson, J., et al. 1987. MAPMAKER: an interactive computer package for constructing primary genetic linkage maps of experimental and natural populations. Genomics 1, 174-181.
15. Menz, M., Klein, R., Mullet, J., et al. 2002. A high-density genetic map of sorghum bicolor (L.) Moench based on 2926 Aflp, Rflp and Ssr markers. Plant Mol. Biol. 48, 483-499.
16. Pevzner, P., and Tesler, G. 2003. Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proc. Natl. Acad. Sci. USA 100, 7672-7677.
17. Polacco, M., and Coe, E. 2002. IBM neighbors: a consensus GeneticMap, personal communication.
18. Sankoff, D., Zheng, C., and Lenert, A. 2005. Reversals of fortune. Proc. 3rd RECOMB Comp. Genom. Satellite Workshop 3678, 131-141.
19. Tang, J., and Moret, B. 2003. Phylogenetic reconstruction from gene rearrangement data with unequal gene contents. Lect. Notes Comput. Sci. 2748, 37-46.
20. Yap, I., Schneider, D., Kleinberg, J., et al. 2003. A graph-theoretic approach to comparing and integrating genetic, physical and sequence-based maps. Genetics 165, 2235-2247.
21. Zheng, C., Lenert, A., and Sankoff, D. 2005. Reversal distance for partially ordered genomes. Bioinformatics 21, Suppl 1, i502-i508.