Multiple matching of parameterized patterns
From MaRDI portal
Publication:672748
DOI10.1016/0304-3975(94)00270-3zbMath0873.68074OpenAlexW2136288438MaRDI QIDQ672748
Alejandro A. Schäffer, Ramana M. Idury
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00270-3
Parallel algorithms in computer science (68W10) Computing methodologies for text processing; mathematical typography (68U15)
Related Items (17)
Efficient parameterized string matching ⋮ The structural border array ⋮ Variations of the parameterized longest previous factor ⋮ \(p\)-suffix sorting as arithmetic coding ⋮ Compressed parameterized pattern matching ⋮ The set of parameterized \(k\)-covers problem ⋮ Online parameterized dictionary matching with one gap ⋮ Parameterized longest previous factor ⋮ Verifying and enumerating parameterized border arrays ⋮ Parameterized dictionary matching and recognition with one gap ⋮ A prefix array for parameterized strings ⋮ Parameterized matching on non-linear structures ⋮ Counting Parameterized Border Arrays for a Binary Alphabet ⋮ A brief history of parameterized matching problems ⋮ Fast parameterized matching with \(q\)-grams ⋮ Dynamic dictionary matching in external memory ⋮ A comparative study of dictionary matching with gaps: limitations, techniques and challenges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on set union with arbitrary deunions
- Making data structures persistent
- The parenthesis tree
- Alphabet dependence in parameterized matching
- Dynamic dictionary matching with failure functions
- Dynamic dictionary matching
- Efficient string matching
- A Space-Economical Suffix Tree Construction Algorithm
- Fast Pattern Matching in Strings
- A theory of parameterized pattern matching
This page was built for publication: Multiple matching of parameterized patterns
