A New Flexible Algorithm for the Longest Common Subsequence Problem - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Claus Rick. A New Flexible Algorithm for the Longest Common Subsequence Problem. In CPM. pages 340-351, 1995.

@inproceedings{Rick95:0,
  title = {A New Flexible Algorithm for the Longest Common Subsequence Problem},
  author = {Claus Rick},
  year = {1995},
  researchr = {https://researchr.org/publication/Rick95%3A0},
  cites = {0},
  citedby = {0},
  pages = {340-351},
  booktitle = {CPM},
}

runs on WebDSL