Efficient parameterized string matching
From MaRDI portal
Publication:845838
DOI10.1016/j.ipl.2006.06.009zbMath1185.68282OpenAlexW2154864405MaRDI QIDQ845838
Maxim Mozgovoy, Kimmo Fredriksson
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.009
Related Items (10)
Secure parameterized pattern matching ⋮ Weighted approximate parameterized string matching ⋮ The structural border array ⋮ Computing the parameterized Burrows-Wheeler transform online ⋮ Verifying and enumerating parameterized border arrays ⋮ A prefix array for parameterized strings ⋮ Unnamed Item ⋮ Counting Parameterized Border Arrays for a Binary Alphabet ⋮ A brief history of parameterized matching problems ⋮ Fast parameterized matching with \(q\)-grams
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiple matching of parameterized patterns
- The smallest automaton recognizing the subwords of a text
- Alphabet dependence in parameterized matching
- Speeding up two string-matching algorithms
- A fast string searching algorithm
- Suffix Arrays: A New Method for On-Line String Searches
- Faster suffix tree construction with missing suffix links
- The Complexity of Pattern Matching for a Random String
- Efficient string matching
- Algorithms on Strings, Trees and Sequences
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
This page was built for publication: Efficient parameterized string matching