Parameterized searching with mismatches for run-length encoded strings

DOI10.1016/j.tcs.2012.03.018zbMath1247.68330OpenAlexW2077046517MaRDI QIDQ714802

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

zbMATH Keywords

bipartite graphsstring searchingparameterized matchingparametric graph matching

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Related Items

Weighted approximate parameterized string matching, An Opportunistic Text Indexing Structure Based on Run Length Encoding, The structural border array, Compressed parameterized pattern matching, A Filtering Technique for All Pairs Approximate Parameterized String Matching, A prefix array for parameterized strings, A brief history of parameterized matching problems

Cites Work

• Parameterized matching with mismatches
• Alphabet dependence in parameterized matching
• Parameterized pattern matching: Algorithms and applications
• Approximate parameterized matching
• Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
• Fibonacci heaps and their uses in improved network optimization algorithms
• Unnamed Item
• Unnamed Item