Algorithms for Computing the Longest Parameterized Common Subsequence

Iliopoulos, Costas S.; Kubica, Marcin; Rahman, M. Sohel; Waleń, Tomasz

by Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Waleń

Reference:

Algorithms for Computing the Longest Parameterized Common Subsequence (Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Waleń), In Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching (B. Ma, Z. Zhang, eds.), Springer, volume 4580, 2007.

Bibtex Entry:

@INPROCEEDINGS{IKRWAlgoParameterCommon,
  author =       "Costas S. Iliopoulos and Marcin Kubica and M. Sohel 
Rahman and Tomasz Wale\'{n}",
  title =        "Algorithms for Computing the Longest Parameterized Common Subsequence",
  booktitle =    "Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching",
  year =         "2007",
  pages =        "265-273",
  publisher = "Springer",
  series    = "Lecture Notes in Computer Science",
  volume    = "4580",
  address =      "Ontario, Canada",
  editor  ="B. Ma and Z. Zhang",
  month =        "July"
}