Abstract
Originating from the work of Navarro and Thankachan [TCS 2016], the problem of consecutive pattern matching is a variant of the fundamental pattern matching problem, where one is given a text and a pair of patterns, and must compute their consecutive occurrences in the text. Assuming that the text is given as a straight-line program, we develop an algorithm that computes all consecutive occurrences in optimal time.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2024 Data Compression Conference (DCC) |
| Publisher | IEEE |
| Publication date | 2024 |
| Pages | 163-172 |
| ISBN (Print) | 979-8-3503-8588-5 |
| ISBN (Electronic) | 979-8-3503-8587-8 |
| DOIs | |
| Publication status | Published - 2024 |
| Event | 2024 Data Compression Conference - Snowbird, United States Duration: 19 Mar 2024 → 22 Mar 2024 |
Conference
| Conference | 2024 Data Compression Conference |
|---|---|
| Country/Territory | United States |
| City | Snowbird |
| Period | 19/03/2024 → 22/03/2024 |
Fingerprint
Dive into the research topics of 'Compressed Consecutive Pattern Matching†'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver