Parameterized searching with mismatches for run-length encoded strings
From MaRDI portal
Publication:714802
DOI10.1016/J.TCS.2012.03.018zbMATH Open1247.68330OpenAlexW2077046517MaRDI QIDQ714802FDOQ714802
Alpár Jüttner, Péter L. Erdős, Alberto Apostolico
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.018
Recommendations
Combinatorics in computer science (68R05) Algorithms on strings (68W32) Computing methodologies for text processing; mathematical typography (68U15)
Cites Work
- Title not available (Why is that?)
- Fibonacci heaps and their uses in improved network optimization algorithms
- Parameterized pattern matching: Algorithms and applications
- Approximate parameterized matching
- Alphabet dependence in parameterized matching
- Parameterized matching with mismatches
- Title not available (Why is that?)
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
Cited In (9)
- The structural border array
- Parameterized matching with mismatches
- Weighted approximate parameterized string matching
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- Compressed parameterized pattern matching
- A brief history of parameterized matching problems
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
- A prefix array for parameterized strings
- A Filtering Technique for All Pairs Approximate Parameterized String Matching
This page was built for publication: Parameterized searching with mismatches for run-length encoded strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714802)
