Skip to main content
SpringerLink
Log in
Book cover

Symposium on Combinatorial Pattern Matching

CPM 2014: Combinatorial Pattern Matching pp 1–10Cite as

On the Efficiency of the Hamming C-Centerstring Problems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8486))

Abstract

The Consensus String Problem is that of finding a string, such that the maximum Hamming distance from it to a given set of strings of the same length is minimized. However, a generalization is necessary for clustering. One needs to consider a partition into a number of sets, each with a distinct centerstring. In this paper we define two natural versions of the consensus problem for c centerstrings. We analyse the hardness and fixed parameter tractability of these problems and provide approximation algorithms.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • 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. Amir, A., Landau, G.M., Na, J.C., Park, H., Park, K., Sim, J.S.: Consensus optimizing both distance sum and radius. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 234–242. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Amir, A., Paryenty, H., Roditty, L.: Approximations and partial solutions for the consensus sequence problem. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol. 7024, pp. 168–173. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Andoni, A., Indyk, P., Patrascu, M.: On the optimality of the dimensionality reduction method. In: Proc. 47th IEEE Symposium on the Foundation of Computer Science (FOCS), pp. 449–458 (2006)

    Google Scholar 

  4. Verbin, E., Yu, W.: Data structure lower bounds on random access to grammar-compressed strings. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 247–258. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Boucher, C., Brown, D.G., Durocher, S.: On the structure of small motif recognition instances. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 269–281. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Boucher, C., Wilkie, K.: Why Large Closest String instances are easy to solve in practice. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 106–117. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Chimani, M., Woste, M., Böcker, S.: A closer look at the closest string and closest substring problem. In: Proc. 13th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 13–24 (2011)

    Google Scholar 

  8. Frances, M., Litman, A.: On covering problems of codes. Theory of Computing Systems 30(2), 113–119 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  9. Gasieniec, L., Jansson, J., Lingas, A.: Approximation algorithms for hamming clustering problems. Journal of Discrete Algorithms 2(2), 289–301 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoretical Computer Science 38, 293–306 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  11. Gramm, J., Niedermeier, R., Rossmanith, P.: Exact solutions for closest string and related problems. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 441–453. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37(1), 25–42 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hufsky, F., Kuchenbecker, L., Jahn, K., Stoye, J., Böcker, S.: Swiftly computing center strings. In: Moulton, V., Singh, M. (eds.) WABI 2010. LNCS, vol. 6293, pp. 325–336. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Lanctot, K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Information and Computation 185(1), 41–55 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. SIAM J. Computing 39(4), 1432–1443 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  16. Stojanovic, N., Berman, P., Gumucio, D., Hardison, R., Miller, W.: A linear-time algorithm for the 1-mismatch problem. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 126–135. Springer, Heidelberg (1997)

    Google Scholar 

  17. Sze, S.-H., Lu, S., Chen, J.: Integrating sample-driven and pattern-driven approaches in motif finding. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol. 3240, pp. 438–449. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Bar-Ilan University, Ramat-Gan, 52900, Israel

    Amihood Amir, Jessica Ficler, Liam Roditty & Oren Sar Shalom

  2. Department of Computer Science, Johns Hopkins University, Baltimore, MD, 21218, USA

    Amihood Amir

Authors
  1. Amihood Amir
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jessica Ficler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Liam Roditty
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Oren Sar Shalom
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. St. Petersburg Department of Steklov Institute of Mathematics, 27 Fontanka, 191023, St. Petersburg, Russia

    Alexander S. Kulikov

  2. National Research University Higher School of Economics, Bldg 3, Bolshoy Trekhsvyatitelskiy pereulok, 109028, Moscow, Russia

    Sergei O. Kuznetsov

  3. University of California at San Diego, 9500 Gilman Drive, EBU3b 4236, 92093-0404, La Jolla, CA, USA

    Pavel Pevzner

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Amir, A., Ficler, J., Roditty, L., Shalom, O.S. (2014). On the Efficiency of the Hamming C-Centerstring Problems. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds) Combinatorial Pattern Matching. CPM 2014. Lecture Notes in Computer Science, vol 8486. Springer, Cham. https://doi.org/10.1007/978-3-319-07566-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07566-2_1

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07565-5

  • Online ISBN: 978-3-319-07566-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation