Skip to main content
Springer Nature Link
Log in

Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem

  • Conference paper
  • First Online:
String Processing and Information Retrieval (SPIRE 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14240))

Included in the following conference series:

  • 547 Accesses

Abstract

Amir et al. (CPM 2017) introduce the approximate string cover problem (ACP) motivated by applications including molecular biology, coding, automata theory, formal language theory and combinatorics. A cover of a string T is a string C for which every letter of T lies within some occurrence of C. The input of the ACP consists of a string T and the goal is to find a string C of length less than the length of T that covers a string \(T'\), which is as close to T as possible (under some predefined distance). Amir et al. study this problem for the Hamming distance and show that it is NP-hard.

In this paper we continue the work of Amir et al. and show the following results for the cover length relaxation of the ACP. After observing that the NP-hardness proof by Amir et al. (CPM 2017, TCS 2019) suffers from several lapses, we propose an amendment to the proof. We then introduce an approximation algorithm for a variant of the ACP, in which we aim to maximize the length of the input string minus the distance to the string covered by the approximate cover returned by the algorithm. This problem is naturally as hard as the ACP. We prove an asymptotic approximation ratio of \(\mathcal {O}(\sqrt{|T|})\), where |T| is the size of the input string. Finally, we present an FPT algorithm with respect to the alphabet size and the size of the cover based on a dynamic programming framework.

This work was supported by a grant of the Ministry of Research, Innovation and Digitization, CNCS - UEFISCDI, project number PN-III-P1-1.1-TE-2021-0253, within PNCDI III. We also thank the PHC Brincusi project between Univ. of Bordeaux and Univ. of Bucharest that facilitated the bilateral visits leading to this work.

M. Raffinot—Currently at Apple.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    In the original construction \(y_4=x_0\), \(y_3=x_{-1}\), \(y_2=x_{N+1}\) and \(y_1=x_{N+2}\).

References

  1. Amir, A., Levy, A., Lewenstein, M., Lubin, R., Porat, B.: Can we recover the cover? In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, 4–6 July 2017, pp. 25:1–25:15 (2017)

    Google Scholar 

  2. Amir, A., Levy, A., Lewenstein, M., Lubin, R., Porat, B.: Can we recover the cover? Algorithmica 81 (2019)

    Google Scholar 

  3. Amir, A., Levy, A., Lubin, R., Porat, E.: Approximate cover of strings. In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, 4–6 July 2017, pp. 26:1–26:14 (2017)

    Google Scholar 

  4. Amir, A., Levy, A., Lubin, R., Porat, E.: Approximate cover of strings. Theor. Comput. Sci. 793, 59–69 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  5. Amir, A., Levy, A., Porat, E.: Quasi-periodicity under mismatch errors. In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, China, 2–4 July 2018, pp. 4:1–4:15 (2018)

    Google Scholar 

  6. Antoniou, P., Crochemore, M., Iliopoulos, C.S., Jayasekera, I., Landau, G.M.: Conservative string covering of indeterminate strings. In: Stringology, pp. 108–115 (2008)

    Google Scholar 

  7. Apostolico, A., Breslauer, D.: Of periods, quasiperiods, repetitions and covers. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 236–248. Springer, Heidelberg (1997). https://doi.org/10.1007/3-540-63246-8_14

    Chapter  Google Scholar 

  8. Apostolico, A., Ehrenfeucht, A.: Efficient detection of quasiperiodicities in strings. Theor. Comput. Sci. 119(2), 247–265 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  9. Apostolico, A., Farach, M., Iliopoulos, C.S.: Optimal superprimitivity testing for strings. Inf. Process. Lett. 39(1), 17–20 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bacciotti, A., Rosier, L.: Liapunov Functions and Stability in Control Theory. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  11. Barton, C., Kociumaka, T., Pissis, S.P., Radoszewski, J.: Efficient index for weighted sequences. In: 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, Tel Aviv, Israel, 27–29 June 2016, pp. 4:1–4:13 (2016)

    Google Scholar 

  12. Breslauer, D.: An on-line string superprimitivity test. Inf. Process. Lett. 44(6), 345–347 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. Breslauer, D.: Testing string superprimitivity in parallel. Inf. Process. Lett. 49(5), 235–241 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  14. Brodal, G.S., Pedersen, C.N.S.: Finding maximal quasiperiodicities in strings. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 397–411. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-45123-4_33

    Chapter  Google Scholar 

  15. Brodzik, A.K.: Quaternionic periodicity transform: an algebraic solution to the tandem repeat detection problem. Bioinformatics 23(6), 694–700 (2007)

    Article  MathSciNet  Google Scholar 

  16. Christodoulakis, M., Iliopoulos, C., Mouchard, L., Perdikuri, K., Tsakalidis, A., Tsichlas, K.: Computation of repetitions and regularities of biologically weighted sequences. J. Comput. Biol. 13(6), 1214–1231 (2006)

    Article  MathSciNet  Google Scholar 

  17. Cole, R., Ilopoulos, C.S., Mohamed, M., Smyth, W.F., Yang, L.: The complexity of the minimum k-cover problem. J. Autom. Lang. Comb. 10(5–6), 641–653 (2005)

    MathSciNet  MATH  Google Scholar 

  18. Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Radoszewski, J., Rytter, W., Walen, T.: Covering problems for partial words and for indeterminate strings. Theor. Comput. Sci. 698, 25–39 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  19. Flouri, T., et al.: Enhanced string covering. Theor. Comput. Sci. 506, 102–114 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  20. Guo, Q., Zhang, H., Iliopoulos, C.S.: Computing the \(\lambda \)-seeds of a string. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 303–313. Springer, Heidelberg (2006). https://doi.org/10.1007/11775096_28

    Chapter  Google Scholar 

  21. Guo, Q., Zhang, H., Iliopoulos, C.S.: Computing the \(\lambda \)-covers of a string. Inf. Sci. 177(19), 3957–3967 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  22. Iliopoulos, C.S., Moore, D.W., Park, K.: Covering a string. Algorithmica 16(3), 288–297 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  23. Katok, A., Hasselblatt, B.: Introduction to the Modern Theory of Dynamical Systems, vol. 54. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  24. Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Waleń, T.: A linear-time algorithm for seeds computation. ACM Trans. Algorithms 16(2) (2020)

    Google Scholar 

  25. Kociumaka, T., Pissis, S.P., Radoszewski, J., Rytter, W., Waleń, T.: Fast algorithm for partial covers in words. Algorithmica 73(1), 217–233 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  26. Kolpakov, R., Kucherov, G.: Finding approximate repetitions under Hamming distance. Theor. Comput. Sci. 303(1), 135–156 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  27. Landau, G.M., Schmidt, J.P., Sokol, D.: An algorithm for approximate tandem repeats. J. Comput. Biol. 8(1), 1–18 (2001)

    Article  Google Scholar 

  28. Li, Y., Smyth, W.F.: Computing the cover array in linear time. Algorithmica 32(1), 95–106 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  29. Ming, L., Vitányi, P.M.: Kolmogorov complexity and its applications. In: Algorithms and Complexity, pp. 187–254. Elsevier (1990)

    Google Scholar 

  30. Moore, D., Smyth, W.F.: An optimal algorithm to compute all the covers of a string. Inf. Process. Lett. 50(5), 239–246 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  31. Moore, D., Smyth, W.F.: A correction to “An optimal algorithm to compute all the covers of a string’’. Inf. Process. Lett. 54(2), 101–103 (1995)

    Article  Google Scholar 

  32. Muchnik, A., Semenov, A., Ushakov, M.: Almost periodic sequences. Theor. Comput. Sci. 304(1–3), 1–33 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  33. Sethares, W.A., Staley, T.W.: Periodicity transforms. IEEE Trans. Signal Process. 47(11), 2953–2964 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  34. Timmermans, M., Heijmans, R., Daniels, H.: Cyclical patterns in risk indicators based on financial market infrastructure transaction data. De Nederlandsche Bank Working Paper (558) (2017)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, Bordeaux INP, LaBRI, UMR 5800, Univ. Bordeaux, 33400, Talence, France

    Guillaume Blin, Mathieu Raffinot & Raluca Uricaru

  2. Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania

    Alexandru Popa

Authors
  1. Guillaume Blin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexandru Popa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mathieu Raffinot
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Raluca Uricaru
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raluca Uricaru .

Editor information

Editors and Affiliations

  1. ISTI-CNR, Pisa, Italy

    Franco Maria Nardini

  2. University of Pisa, Pisa, Italy

    Nadia Pisanti

  3. University of Pisa, Pisa, Italy

    Rossano Venturini

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Blin, G., Popa, A., Raffinot, M., Uricaru, R. (2023). Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. In: Nardini, F.M., Pisanti, N., Venturini, R. (eds) String Processing and Information Retrieval. SPIRE 2023. Lecture Notes in Computer Science, vol 14240. Springer, Cham. https://doi.org/10.1007/978-3-031-43980-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-43980-3_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-43979-7

  • Online ISBN: 978-3-031-43980-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics