The zero exemplar distance problem

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

Volumn 6398 LNBI, Issue , 2010, Pages 74-82

  Jiang, Minghui ^a  

^a Utah State University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENE ORDERS; GENOME REARRANGEMENTS; MULTICHROMOSOMAL GENOMES; NP-HARD; POLYNOMIAL-TIME ALGORITHMS; EXEMPLAR MODELS;

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

GENES;

EID: 78649939271     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16181-0_7     Document Type: Conference Paper

References (11)

1. Adi, S.S., Braga, M.D.V., Fernandes, C.G., Ferreira, C.E., Martinez, F.V., Sagot, M.-F., Stefanes, M.A., Tjandraatmadja, C., Wakabayashi, Y.: Repetition-free longest common subsequence. Discrete Applied Mathematics 158, 1315-1324 (2010)
2. Angibaud, S., Fertin, G., Rusu, I., Thévenin, A., Vialette, S.: On the approximability of comparing genomes with duplicates. Journal of Graph Algorithms and Applications 13, 19-53 (2009)
3. 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)
4. Bonizzoni, P., Della Vedova, G., Dondi, R., Fertin, G., Rizzi, R., Vialette, S.: Exemplar longest common subsequence. IEEE/ACM Transactions on Computational Biology and Bioinformatics 4, 535-543 (2007)
5. Chen, Z., Fowler, R.H., Fu, B., Zhu, B.: On the inapproximability of the exemplar conserved interval distance problem of genomes. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 245-254. Springer, Heidelberg (2006)
6. Chen, Z., Fu, B., Zhu, B.: The approximability of 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. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
8. Ferretti, V., Nadeau, J.H., Sankoff, D.: Original synteny. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 159-167. Springer, Heidelberg (1996)
9. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
10. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2, 225-231 (1973)
11. Sankoff, D.: Genome rearrangement with gene families. Bioinformatics 15, 909-917 (1999)