Efficient parameterized pattern matching in sublinear space

DOI10.1007/978-3-031-43980-3_22MaRDI QIDQ6545436

Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara, Haruki Ideguchi

Publication date: 29 May 2024

zbMATH Keywords

string matchingcombinatorics on wordsparameterized matchingsublinear space

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Periodicity and repetitions in parameterized strings
• String-matching on ordered alphabets
• Alphabet dependence in parameterized matching
• Time-space-optimal string matching
• Parameterized pattern matching: Algorithms and applications
• A brief history of parameterized matching problems
• Parameterized DAWGs: efficient constructions and bidirectional pattern searches
• Suffix Arrays: A New Method for On-Line String Searches
• Saving Space in Fast String-Matching
• Fast Pattern Matching in Strings
• Two-way string-matching
• Position Heaps for Parameterized Strings
• Uniqueness Theorems for Periodic Functions

This page was built for publication: Efficient parameterized pattern matching in sublinear space