On the longest common parameterized subsequence

DOI10.1016/j.tcs.2009.09.011zbMath1186.68148OpenAlexW2109212736MaRDI QIDQ1038473

Tsvi Kopelowitz, Orgad Keller, Moshe Lewenstein

Publication date: 18 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.011

zbMATH Keywords

parameterized matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Approximation algorithms (68W25)

Related Items (8)

Weighted approximate parameterized string matching ⋮ Hardness and approximation of multiple sequence alignment with column score ⋮ Online parameterized dictionary matching with one gap ⋮ Parameterized dictionary matching and recognition with one gap ⋮ Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications ⋮ Unnamed Item ⋮ A brief history of parameterized matching problems ⋮ A comparative study of dictionary matching with gaps: limitations, techniques and challenges

Cites Work

• Unnamed Item
• 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
• Combinatorial Pattern Matching

This page was built for publication: On the longest common parameterized subsequence