A polynomial algebra method for computing exemplar breakpoint distance

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

Volumn 6674 LNBI, Issue , 2011, Pages 297-305

  Fu, Bin ^a   Zhang, Louxin ^b  

^a UNIVERSITY OF TEXAS PAN AMERICAN   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

examplar breakpoint distance; Genome rearrangement

Indexed keywords

BREAKPOINT DISTANCE; COMPUTATION TIME; GENE FAMILIES; GENOME REARRANGEMENTS; NP-HARD; POLYNOMIAL ALGEBRA; TIME ALGORITHMS;

ALGORITHMS; BIOINFORMATICS; POLYNOMIALS;

GENES;

EID: 79955840543     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21260-4_29     Document Type: Conference Paper

References (19)

1. Angibaud, S., Fertin, G., Rusu, I., Thévenin, A., Vialette, S.: A pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes. In: Tesler, G., Durand, D. (eds.) RECMOB-CG 2007. LNCS (LNBI), vol. 4751, pp. 16-29. Springer, Heidelberg (2007)
2. Angibaud, S., Fertin, G., Rusu, I., Thévenin, A., Vialette, S.: On the approximability of comparing genomes with duplicates. J. Graph Algor. Appli. (accepted)
3. Blin, G., Chauve, C., Fertin, G., Rizzi, R., Vialette, S.: Comparing genomes with duplications: A computational complexity point of view. IEEE/ACM IEEE Trans. Comput. Biol. Bioinform. 4, 523-534 (2007)
4. Blin, G., Fertin, G., Sikora, F., Vialette, S.: The exemplar breakpoint distance for non-trivial genomes cannot be approximated. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 357-368. Springer, Heidelberg (2009)
5. Bryant, D.: The complexity of calculating exemplar distance. In: Sankoff, D., Nadeau, J. (eds.) Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pp. 207-212 (2000)
6. Chen, Z., Fu, B., Zhu, B.: Approximations for the exemplar breakpoint distance problem. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 291-302. Springer, Heidelberg (2006)
7. Chen, Z., Fu, B.: Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials, Electronic Colloquium on Computational Complexity (ECCC-TR10-124)
8. Chen, Z., Fu, B.: The Complexity of Testing Monomials in Multivariate Polynomials, Electronic Colloquium on Computational Complexity (ECCC-TR10-114)
9. Eichler, E.E., Sankoff, D.: Structural dynamics of eukaryotic chromosome evolution. Science 301, 793-797 (2003)
10. Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. Assoc. Comput. Mach. 46, 1-27 (1999)
11. Jiang, M.: The zero exemplar distance problem. In: Tannier, E. (ed.) RECOMB-CG 2010. LNCS, vol. 6398, pp. 74-82. Springer, Heidelberg (2010)
12. Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 575-586. Springer, Heidelberg (2008)
13. Nadeau, J.H., Taylor, B.A.: Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. USA 81, 814-818 (1984)
14. Nguyen, C.T.: Algorithms for calculating exemplar distances. Honors Thesis, Department of Computer Science, National University of Singapore (2005)
15. Nguyen, C.T., Tay, Y.C., Zhang, L.X.: Divide-and-conquer approach for the examplar breakpoint problem. Bioinformatics 21, 2171-2176 (2005)
16. Sankoff, D.: Mechanisms of genome evolution: models and inference. Bull. Int. Stat. Institut. 47, 461-475 (1989)
17. Sankoff, D.: Genome rearrangement with gene families. Bioinformatics 15, 909-917 (2009)
18. k) time. Information Processing Letters 109, 315-318 (2009)
19. Watterson, G.A., Ewens, W.J., Hall, T.E., Morgan, A.: The chromosome inversion problem. J. Theor. Biol. 99, 1-7 (1982)