Algorithms for Computing the Longest Parameterized Common Subsequence

@inproceedings{Iliopoulos2007AlgorithmsFC,
  title={Algorithms for Computing the Longest Parameterized Common Subsequence},
  author={Costas S. Iliopoulos and Marcin Kubica and Mohammad Sohel Rahman and Tomasz Walen},
  booktitle={CPM},
  year={2007}
}
In this paper, we revisit the classic and well-studied longest common subsequence (LCS) problem and study some new variants, first introduced and studied by Rahman and Iliopoulos [Algorithms for Computing Variants of the Longest Common Subsequence Problem, ISAAC 2006]. Here we define a generalization of these variants, the longest parameterized common subsequence (LPCS) problem, and show how to solve it in O(n) and O(n+R log n) time. Furthermore, we show how to compute two variants of LCS… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Parameterized diff

  • Brenda S. Baker
  • In Symposium of Discrete Algorithms (SODA),
  • 1999
1 Excerpt

Minimum detour methods for string or sequence comparison

  • F. Hadlock
  • Congressus Numerantium,
  • 1988
1 Excerpt

An O(ND) difference algorithm and its variations

  • Eugene W. Myers
  • 1986
2 Excerpts

Similar Papers

Loading similar papers…