Multichromosomal genome median and halving problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5251 LNBI, Issue , 2008, Pages 1-13

  Tannier, Eric ^a   Zheng, Chunfang ^b   Sankoff, David ^b  

^a UNIVERSITÉ LYON 1   (France)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

NUCLEAR PROPULSION; TECHNICAL PRESENTATIONS;

ANCESTRAL GENOMES; BREAKPOINT DISTANCES; EVOLUTIONARY EVENTS; MEDIAN PROBLEMS; MULTICHROMOSOMAL GENOMES; NP HARDNESSES; REVERSAL DISTANCES; UNICHROMOSOMAL GENOMES;

BIOINFORMATICS;

EID: 56649103607     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87361-7_1     Document Type: Conference Paper

References (26)

1. Adam, Z., Sankoff, D.: The ABCs of MGR with DCJ. Evol. Bio-inform. 4, 69-74 (2008)
2. Alekseyev, M., Pevzner, P.: Colored de Bruijn graphs and the genome halving problem. TCBB 4, 98-107 (2008)
3. Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163-173. Springer, Heidelberg (2006)
4. Berman, P., Karpinski, M.: On some tighter inapproximability results: Further improvements. ECCC Report 65, Univ. of Trier. (1998), http://www.eccc.uni-trier.de/
5. Bourque, G., Pevzner, P.A.: Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res. 12, 26-36 (2002)
6. Bryant, D.: The complexity of the breakpoint median problem. TR CRM-2579. Centre de recherches mathématiques, Université de Montréal (1998)
7. Caprara, A.: The reversal median problem. INFORMS J. Comput. 15, 93-113 (2003)
8. Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignement of orthologous genes via genome rearrangement. IEEE/ACM Transactions on Computational Biology and Bioinformatics 2, 302-315 (2005)
9. El-Mabrouk, N., Sankoff, D.: The reconstruction of doubled genomes. SIAM J. Comput. 32, 754-792 (2003)
10. Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. JACM 46, 1-27 (1999)
11. Hannenhalli, S., Pevzner, P.A.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: FOCS 1995, pp. 581-592 (1995)
12. Jean, G., Nikolski, M.: Genome rearrangements: a correct algorithm for optimal capping. Inf. Process Lett. 104, 14-20 (2007)
13. Lenne, R., Solnon, C., Stiitzle, T., Tannier, E., Birattari, M.: Reactive stochastic local search algorithms for the genomic median problem. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol. 4972, pp. 266-276. Springer, Heidelberg (2008)
14. Lin, Y.C., Lu, C.L., Chang, H.Y., Tang, C.: An efficient algorithm for sorting by block-interchange and its application to the evolution of vibrio species. JCB 12, 102-112 (2005)
15. Mixtacki, J.: Genome halving under DCJ revisited. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092. Springer, Heidelberg (2008)
16. Ozery-Flato, M., Shamir, R.: Two notes on genome rearrangement. JBCB 1, 71-94 (2003)
17. Pe'er, I., Shamir, R.: The median problems for breakpoints are NP-complete. In: ECCC (1998)
18. Sankoff, D., Blanchette, M.: The median problem for breakpoints in comparative genomics. In: Jiang, T., Lee, D.T. (eds.) COCOON 1997. LNCS, vol. 1276, pp. 251-263. Springer, Heidelberg (1997)
19. Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. JCSS 65, 587-609 (2002)
20. Warren, R., Sankoff, D.: Genome halving with general operations. APBC 2008, Adv. Bioinform. Comput. Biol. 6, 231-240 (2008)
21. Watterson, G., Ewens, W., Hall, T., Morgan, A.: The chromosome inversion problem. J. Theoret. Biol. 99, 1-7 (1982)
22. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinform. 21, 3340-3346 (2005)
23. Zheng, C., Wall, P.K., Leebens-Mack, J., de Pamphilis, C., Albert, V.A., Sankoff, D.: The effect of massive gene loss following whole genome duplication on the algorithmic reconstruction of the ancestral Populus diploid. In: CSB 2008 (in press, 2008)
24. Zheng, Z., Zhu, Q., Adam, Z., SankofF, D.: Guided genome halving: hardness, heuristics and the history of the Hemiascomycetes. In: ISMB 2008 (in press, 2008)
25. Zheng, Z., Zhu, Q., Sankoff, D.: Genome halving with an outgroup. Evol. Bioinform. 2, 319-326 (2006)
26. Zheng, Z., Zhu, Q., Sankoff, D.: Descendants of whole genome duplication within gene order phylogeny. In: JOB (in press, 2008)