Parameterized matching with mismatches

DOI10.1016/j.jda.2006.03.014zbMath1139.68055OpenAlexW2019919026MaRDI QIDQ924551

Alberto Apostolico, Moshe Lewenstein, Péter L. Erdős

Publication date: 16 May 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.03.014

zbMATH Keywords

algorithmsstring matchingpattern matchingparameterized matchingpattern matching with mismatches

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Related Items

Permuted function matching ⋮ Weighted approximate parameterized string matching ⋮ The structural border array ⋮ Compressed parameterized pattern matching ⋮ Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ A Filtering Technique for All Pairs Approximate Parameterized String Matching ⋮ Finding patterns and periods in Cartesian tree matching ⋮ Unnamed Item ⋮ Verifying and enumerating parameterized border arrays ⋮ Towards a real time algorithm for parameterized longest common prefix computation ⋮ Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications ⋮ A prefix array for parameterized strings ⋮ Parameterized searching with mismatches for run-length encoded strings ⋮ Parameterized matching on non-linear structures ⋮ Counting Parameterized Border Arrays for a Binary Alphabet ⋮ A brief history of parameterized matching problems ⋮ Cartesian Tree Matching and Indexing

Cites Work

• The upper envelope of piecewise linear functions: Algorithms and applications
• Parameterized pattern matching: Algorithms and applications
• A Decomposition Theorem for Maximum Weight Bipartite Matchings
• 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