A New Efficient Algorithm for computing the Longest Common Subsequence

Rahman, Mohammad Sohel; Iliopoulos, Costas S.

by Mohammad Sohel Rahman, Costas S. Iliopoulos

Reference:

A New Efficient Algorithm for computing the Longest Common Subsequence (Mohammad Sohel Rahman, Costas S. Iliopoulos), In Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (M. Y. Kao, X. Y. Li, eds.), Springer, volume 4508, 2007.

Bibtex Entry:

@INPROCEEDINGS{RahmanI07,
  author    =    "Mohammad Sohel Rahman and Costas S. Iliopoulos",
  title     =    "A New Efficient Algorithm for computing the Longest Common Subsequence",
  booktitle =    "Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management ",
  year      =    "2007",
  month =        "June",
  address =      "Portland, USA",
  editor  =      "M. Y. Kao and X. Y. Li",
  pages     =    "82--90",
  publisher = "Springer",
  series    = "Lecture Notes in Computer Science",
  volume    = "4508"
}