Genetic map refinement using a comparative genomic approach

Journal of Computational Biology

Volumn 16, Issue 10, 2009, Pages 1475-1486

  Bertrand, Denis ^a   Blanchette, Mathieu ^b   El Mabrouk, Nadia ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

Algorithms; Branch and bound; Genomic rearrangements

Indexed keywords

ARTICLE; DATA BASE; GENE MAPPING; GENE ORDER; GENE REARRANGEMENT; GENETIC ALGORITHM; GENETIC RECOMBINATION; GENOME ANALYSIS; MATHEMATICAL GENETICS; PHYLOGENETIC TREE; PLANT GENETICS; PRIORITY JOURNAL;

ALGORITHMS; CHROMOSOME MAPPING; GENETIC MARKERS; GENOME, PLANT; GENOMICS; MODELS, GENETIC; PHYLOGENY;

EID: 70349808215     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2009.0094     Document Type: Article

References (21)

1. Ailon, N., Charikar, M., and Newman, A. 2005. Aggregating inconsistent information: ranking and clustering. Proc. 37th Annu. ACM Symp. Theory Comput. 684-693.
2. Blin, G., Blais, E., Hermelin, D., et al., 2007. Gene maps linearization using genomic rearrangement distances. J. Comput. Biol. 14, 394-407.
3. Caprara, A. 2003. The reversal median problem. J. Comput. 15, 93-113.
4. Collard, B., Jahufer, M., Brouwer, J., et al. 2005. An introduction to markers, quantitative trait loci (QTL) mapping and marker-assisted selection for crop improvement: the basic concepts. Euphytica 142, 169-196.
5. Fitch, W. 1971. Toward defining the course of evolution: minimum change for a specific tree topology. System. Zool. 20.
6. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
7. Jackson, B., Aluru, S., and Schnable, P. 2005. Consensus genetic maps: a graph theoretic approach. IEEE Comput. Syst. Bioinform. Conf. (CSB'05) 35-43.
8. Jackson, B., Schnable, P., and Aluru, S. 2008. Consensus genetic maps as median orders from inconsistent sources. IEEE/ACM Trans. Comput. Biol. Bioinform. 5, 161-171.
9. Jaiswal, P., et al. 2006. Gramene: a bird's eye view of cereal genomes. Nucleic Acids Res. 34, D717-D723.
10. Kellogg, E. 1998. Relationships of cereal crops and other grasses. Proc. Natl. Acad. Sci. USA 95, 2005-2010.
11. Kemeny, J. 1959. Mathematics without numbers. Daedelus 88, 577-591.
12. Ma, J., Zhang, L., Suh, B., et al. 2006. Reconstructing contiguous regions of an ancestral genome. Genome Res. 16, 1557-1565.
13. Nuutila, E., and Soisalon-Soininen, E. 1993. On finding the strongly connected components in a directed graph. Inform. Process. Lett. 49, 9-14.
14. Pe'er, I., and Shamir, R. 1998. The median problems for breakpoints are NP-complete. Electronic Colloquium on Computational Complexity (ECCC) Report 71 .
15. Saari, D., and Merlin, V. 2000. A geometric examination of Kemeny's rule. Social Choice Welfare 7, 81-90.
16. Sankoff, D., and Blanchette, M. 1998. Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol. 5, 555-570.
17. Tarjan, R.E. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146-160.
18. Wakabayashi, Y. 1998. The complexity of computing medians of relations. Resenhas 3, 323-349.
19. 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.
20. Zheng, C., Lenert, A., and Sankoff, D. 2005. Reversal distance for partially ordered genomes. Bioinformatics 21, i502-i508.
21. Zheng, C., Zhu, Q., and Sankoff, D. 2007. Removing noise and ambiguities from comparative maps in rearrangement analysis. IEEE/ACM Trans. Comput. Biol. Bioinform. 4, 515-522.