Document Open Access Logo

Online Approximate Circular Pattern Matching in Small Space

Authors Panagiotis Charalampopoulos , Taha El Ghazi , Jonas Ellert , Paweł Gawrychowski , Tatiana Starikovskaya

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2026.99.pdf
  • Filesize: 1.09 MB
  • 16 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Streaming models
  • Theory of computation → Pattern matching
Keywords
  • Small-space algorithms
  • approximate pattern matching
  • circular pattern matching

Metrics

Abstract

In approximate circular pattern matching the goal is to compute all approximate occurrences of all rotations of a pattern P in a text T. We study this problem under the two most fundamental string distance metrics, the Hamming distance and the edit distance, in the setting where the text arrives online and the available space is limited. Specifically, we wish to report each ending position j of an approximate occurrence before symbol T[j+1] arrives, using sublinear space on top of having read-only access to P and (the seen prefix of) T. For both variants, we present algorithms that use O(poly(k)) extra space and process each arriving symbol in O(poly(k)) time. Notably, with an overhead, our algorithms can be lifted to the asymmetric streaming setting, where we only have read-only access to the pattern for free and account for all extra space.

Cite As Get BibTex

Panagiotis Charalampopoulos, Taha El Ghazi, Jonas Ellert, Paweł Gawrychowski, and Tatiana Starikovskaya. Online Approximate Circular Pattern Matching in Small Space. In 34th Annual European Symposium on Algorithms (ESA 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 388, pp. 99:1-99:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ESA.2026.99

Author Details

Panagiotis Charalampopoulos
  • King’s College London, UK
Taha El Ghazi
  • DIENS, École normale supérieure de Paris, PSL Research University, France
Jonas Ellert
  • University of Southern Denmark, Odense, Denmark
Paweł Gawrychowski
  • Institute of Computer Science, University of Wrocław, Poland
Tatiana Starikovskaya
  • DIENS, École normale supérieure de Paris, PSL Research University, France

Funding

  • Ellert, Jonas: Partially supported by an ERCIM Alain Bensoussan fellowship (during his time at CWI Amsterdam, The Netherlands).

References

  1. Alexandr Andoni, Robert Krauthgamer, and Krzysztof Onak. Polylogarithmic approximation for edit distance and the asymmetric query complexity. In Proc. of FOCS, pages 377-386, 2010. URL: https://doi.org/10.1109/FOCS.2010.43.
  2. Lorraine A.K. Ayad, Carl Barton, and Solon P. Pissis. A faster and more accurate heuristic for cyclic edit distance computation. Pattern Recognit. Lett., 88:81-87, 2017. URL: https://doi.org/10.1016/j.patrec.2017.01.018.
  3. Gabriel Bathie, Panagiotis Charalampopoulos, and Tatiana Starikovskaya. Internal pattern matching in small space and applications. In Proc. of CPM, pages 4:1-4:20, 2024. URL: https://doi.org/10.4230/LIPIcs.CPM.2024.4.
  4. Gabriel Bathie, Tomasz Kociumaka, and Tatiana Starikovskaya. Small-space algorithms for the online language distance problem for palindromes and squares. In Proc. of ISAAC, pages 10:1-10:17, 2023. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2023.10.
  5. Dany Breslauer, Roberto Grossi, and Filippo Mignosi. Simple real-time constant-space string matching. In Proc. of CPM, pages 173-183, 2011. URL: https://doi.org/10.1007/978-3-642-21458-5_16.
  6. Panagiotis Charalampopoulos, Taha El Ghazi, Jonas Ellert, Paweł Gawrychowski, and Tatiana Starikovskaya. Suffix random access via function inversion: A key for asymmetric streaming string algorithms, 2026. Accepted to ICALP'2026. URL: https://doi.org/10.48550/arXiv.2604.19371.
  7. Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, and Wiktor Zuba. Circular pattern matching with k mismatches. J. Comput. Syst. Sci., 115:73-85, 2021. URL: https://doi.org/10.1016/J.JCSS.2020.07.003.
  8. Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, and Wiktor Zuba. Approximate circular pattern matching. In Proc. of ESA, pages 35:1-35:19, 2022. Full version: https://doi.org/10.48550/arXiv.2208.08915. URL: https://doi.org/10.4230/LIPIcs.ESA.2022.35.
  9. Panagiotis Charalampopoulos, Tomasz Kociumaka, and Philip Wellnitz. Faster approximate pattern matching: A unified approach. In Proc. of FOCS, pages 978-989, 2020. Full version: https://doi.org/10.48550/arXiv.2004.08350. URL: https://doi.org/10.1109/FOCS46700.2020.00095.
  10. Panagiotis Charalampopoulos, Tomasz Kociumaka, and Philip Wellnitz. Faster pattern matching under edit distance : A reduction to dynamic puzzle matching and the seaweed monoid of permutation matrices. In Proc. of FOCS, pages 698-707, 2022. Full version: https://doi.org/10.48550/arXiv.2204.03087. URL: https://doi.org/10.1109/FOCS54457.2022.00072.
  11. Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, and Wiktor Zuba. Approximate circular pattern matching under edit distance. In Proc. of STACS, pages 24:1-24:22, 2024. URL: https://doi.org/10.4230/LIPIcs.STACS.2024.24.
  12. Kuei-Hao Chen, Guan-Shieng Huang, and Richard Chia-Tung Lee. Bit-Parallel Algorithms for Exact Circular String Matching. Comput. J., 57(5):731-743, March 2013. URL: https://doi.org/10.1093/comjnl/bxt023.
  13. Richard Cole and Ramesh Hariharan. Approximate String Matching: A Simpler Faster Algorithm. SIAM J. Comput., 31(6):1761-1782, 2002. URL: https://doi.org/10.1137/S0097539700370527.
  14. Nathan J. Fine and Herbert S. Wilf. Uniqueness theorems for periodic functions. Proc. Am. Math. Soc., 16:109-114, 1965. URL: https://doi.org/10.1090/S0002-9939-1965-0174934-9.
  15. Johannes Fischer, Travis Gagie, Pawel Gawrychowski, and Tomasz Kociumaka. Approximating LZ77 via small-space multiple-pattern matching. In Proc. of ESA, pages 533-544, 2015. Full version available at https://doi.org/10.48550/arXiv.1504.06647. URL: https://doi.org/10.1007/978-3-662-48350-3_45.
  16. Kimmo Fredriksson and Szymon Grabowski. Average-optimal string matching. J. Discrete Algorithms, 7(4):579-594, 2009. URL: https://doi.org/10.1016/j.jda.2008.09.001.
  17. Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, and Fatima Vayani. Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol., 11:12, 2016. URL: https://doi.org/10.1186/S13015-016-0076-6.
  18. Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, and Sharma V. Thankachan. Space-efficient construction algorithm for the circular suffix tree. In Proc. of CPM, pages 142-152, 2013. URL: https://doi.org/10.1007/978-3-642-38905-4_15.
  19. Wing-Kai Hon, Chen-Hua Lu, Rahul Shah, and Sharma V. Thankachan. Succinct indexes for circular patterns. In Proc. of ISAAC, pages 673-682, 2011. URL: https://doi.org/10.1007/978-3-642-25591-5_69.
  20. Costas S. Iliopoulos, Solon P. Pissis, and M. Sohel Rahman. Searching and indexing circular patterns. In Algorithms for Next-Generation Sequencing Data: Techniques, Approaches, and Applications, pages 77-90. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-59826-0_3.
  21. Gad M. Landau and Uzi Vishkin. Fast parallel and serial approximate string matching. J. Algorithms, 10(2):157-169, 1989. URL: https://doi.org/10.1016/0196-6774(89)90010-2.
  22. M. Lothaire. Applied Combinatorics on Words. Encyclopedia of Mathematics and its Applications. Cambridge University Press, 2005. Google Scholar
  23. Michael E. Saks and C. Seshadhri. Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance. In Proc. of SODA, pages 1698-1709, 2013. URL: https://doi.org/10.1137/1.9781611973105.122.
  24. Robert Susik, Szymon Grabowski, and Sebastian Deorowicz. Fast and simple circular pattern matching. In Proc. of ICMMI (Man-Machine Interactions 3), pages 537-544, 2013. URL: https://doi.org/10.1007/978-3-319-02309-0_59.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact