On the Longest Common Parameterized Subsequence

DOI10.1007/978-3-540-69068-9_28zbMath1143.68639OpenAlexW2124788815MaRDI QIDQ3506962

Tsvi Kopelowitz, Orgad Keller, Moshe Lewenstein

Publication date: 17 June 2008

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69068-9_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

The set of parameterized \(k\)-covers problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An \(O(ND)\) difference algorithm and its variations
• A faster algorithm computing string edit distances
• A longest common subsequence algorithm suitable for similar text strings
• Alphabet dependence in parameterized matching
• Parameterized pattern matching: Algorithms and applications
• The string B-tree
• Faster suffix tree construction with missing suffix links
• Approximate parameterized matching
• A fast algorithm for computing longest common subsequences
• The Complexity of Some Problems on Subsequences and Supersequences
• Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
• The String-to-String Correction Problem
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• Reducibility among Combinatorial Problems
• Combinatorial Pattern Matching

This page was built for publication: On the Longest Common Parameterized Subsequence