Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata

Iliopoulos, Costas S.; Rahman, Mohammad Sohel; Vorácek, Michal; Vagner, L.

by Costas S. Iliopoulos, Mohammad Sohel Rahman, Michal Vorácek, L. Vagner

Reference:

Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata (Costas S. Iliopoulos, Mohammad Sohel Rahman, Michal Vorácek, L. Vagner), In Proceedings of the 3rd Algorithms and Complexity in Durham Workshop (H. Broesma, M. Jhonson S. Dantcher, S. Szeider, eds.), volume 9, 2007.

Bibtex Entry:

@INPROCEEDINGS{IRVV07ComputingLCSAutomata,
  AUTHOR =       "Costas S. Iliopoulos and Mohammad Sohel Rahman and Michal Vor{\'a}cek and L. Vagner",
  TITLE =        "Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata",
  BOOKTITLE =    "Proceedings of the 3rd Algorithms and Complexity in Durham Workshop",
  year =         "2007",
  pages =        "95--106",
  editor= "H. Broesma and S. Dantcher, M. Jhonson and S. Szeider",
  volume ="9",
  series ="Text in Algorithmics",
  address =      "Durham, UK",
  month =        "September"
}