Skip to main content

Inapproximability of (1,2)-Exemplar Distance

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNBI,volume 7292)

Abstract

Given two genomes possibly with duplicate genes, the exemplar distance problem is that of removing all but one copy of each gene in each genome, so as to minimize the distance between the two reduced genomes according to some measure. Let (s,t)-Exemplar Distance denote the exemplar distance problem on two genomes G 1 and G 2 where each gene occurs at most s times in G 1 and at most t times in G 2. We show that the simplest non-trivial variant of the exemplar distance problem, (1,2)-Exemplar Distance, is already hard to approximate for a wide variety of distance measures, including popular genome rearrangement measures such as adjacency disruptions and signed reversals, and classic string edit distance measures such as Levenshtein and Hamming distances.

Keywords

  • Comparative genomics
  • hardness of approximation
  • adjacency disruption
  • sorting by reversals
  • edit distance
  • Levenshtein distance
  • Hamming distance

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoretical Computer Science 237, 123–134 (2000)

    CrossRef  MathSciNet  MATH  Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

  3. Berman, P., Karpinski, M.: On Some Tighter Inapproximability Results. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 200–209. Springer, Heidelberg (1999)

    CrossRef  Google Scholar 

  4. Blin, G., Chauve, C., Fertin, G., Rizzi, R., Vialette, S.: Comparing genomes with duplications: a computational complexity point of view. IEEE/ACM Transactions on Computational Biology and Bioinformatics 4, 523–534 (2007)

    CrossRef  Google Scholar 

  5. 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)

    CrossRef  Google Scholar 

  6. 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)

    CrossRef  Google Scholar 

  7. Chen, Z., Fowler, R.H., Fu, B., Zhu, B.: On the inapproximability of the exemplar conserved interval distance problem of genomes. Journal of Combinatorial Optimization 15, 201–221 (2008); A preliminary version appeared in Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON 2006, pp. 245–254 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. 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)

    CrossRef  Google Scholar 

  9. Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162, 439–485 (2005)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979)

    Google Scholar 

  11. Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM 46, 1–27 (1999)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Jiang, M.: The zero exemplar distance problem. Journal of Computational Biology 18, 1077–1086 (2011)

    CrossRef  MathSciNet  Google Scholar 

  13. Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2 − ε. Journal of Computer and System Sciences 74, 335–349 (2008)

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. Sankoff, D.: Genome rearrangement with gene families. Bioinformatics 15, 909–917 (1999)

    CrossRef  Google Scholar 

  15. Sankoff, D., Haque, L.: Power Boosts for Cluster Tests. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3678, pp. 121–130. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bulteau, L., Jiang, M. (2012). Inapproximability of (1,2)-Exemplar Distance. In: Bleris, L., Măndoiu, I., Schwartz, R., Wang, J. (eds) Bioinformatics Research and Applications. ISBRA 2012. Lecture Notes in Computer Science(), vol 7292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30191-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30191-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30190-2

  • Online ISBN: 978-3-642-30191-9

  • eBook Packages: Computer ScienceComputer Science (R0)