Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The ll-known problem of the longest common subsequence (LCS), of two strings of lengths  n and  m respectively, is  O ( nm )-time solvable and is a classical distance measure for strings. Another ll-studied string comparison measure is that of parameterized matching, where two equal-length strings are a parameterized-match if there exists a bijection on the alphabets such that one string matches the other under the bijection. All works associated with parameterized pattern matching present polynomial time algorithms.#R##N##R##N#There have been several attempts to accommodate parameterized matching along with other distance measures, as these turn out to be natural problems, e.g., Hamming distance, and a bounded version of edit-distance. Several algorithms have been proposed for these problems.#R##N##R##N#  consider the longest common parameterized subsequence problem which combines the LCS measure with parameterized matching.  prove that the problem is NP-hard, and then show a couple of approximation algorithms for the problem.
['Orgad Keller', 'Tsvi Kopelowitz', 'Moshe Lewenstein']
I am writing a research paper on a idea On the Longest Common Parameterized Subsequence
[{"from": "human", "value": "I am writing a research paper on a idea On the Longest Common Parameterized Subsequence"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The ll-known problem of the longest common subsequence (LCS), of two strings of lengths  n and  m respectively, is  O ( nm )-time solvable and is a classical distance measure for strings. Another ll-studied string comparison measure is that of parameterized matching, where two equal-length strings are a parameterized-match if there exists a bijection on the alphabets such that one string matches the other under the bijection. All works associated with parameterized pattern matching present polynomial time algorithms.#R##N##R##N#There have been several attempts to accommodate parameterized matching along with other distance measures, as these turn out to be natural problems, e.g., Hamming distance, and a bounded version of edit-distance. Several algorithms have been proposed for these problems.#R##N##R##N#  consider the longest common parameterized subsequence problem which combines the LCS measure with parameterized matching.  prove that the problem is NP-hard, and then show a couple of approximation algorithms for the problem."}]