Algorithms for Computing Variants of the Longest Common Subsequence Problem

Iliopoulos, Costas S.; Rahman, Mohammad Sohel

by Costas S. Iliopoulos, Mohammad Sohel Rahman

Abstract:

Reference:

Algorithms for Computing Variants of the Longest Common Subsequence Problem (Costas S. Iliopoulos, Mohammad Sohel Rahman), In Proceedings of the 17th International Symposium on Algorithms and Computation (T. Asano, ed.), Springer, volume , 2006. ()

Bibtex Entry:

@INPROCEEDINGS{IR06AlgoVarLCS,
  AUTHOR =       "Costas S. Iliopoulos and Mohammad Sohel Rahman",
  TITLE =        "Algorithms for Computing Variants of the Longest Common Subsequence Problem",
  BOOKTITLE =    "Proceedings of the 17th International Symposium on Algorithms and Computation",
  YEAR =         "2006",
  editor =       "T. Asano",
  volume =       "",
  number =       "4288",
  series =       "Lecture Notes in Computer Science",
  pages =        "399-408",
  address =      "Kolkata, India",
  month =        "December",
  organization = "",
  publisher =    "Springer",
  note =         "",
  abstract =     "",
  keywords =     ""
}