Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint

Jean Frédéric Myoupo, Armel Nkonjoh Ngomade, Vianney Kengne Tchendji. Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint. In 2018 International Conference on High Performance Computing & Simulation, HPCS 2018, Orleans, France, July 16-20, 2018. pages 1038-1044, IEEE, 2018. [doi]

@inproceedings{MyoupoNT18,
  title = {Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint},
  author = {Jean Frédéric Myoupo and Armel Nkonjoh Ngomade and Vianney Kengne Tchendji},
  year = {2018},
  doi = {10.1109/HPCS.2018.00163},
  url = {https://doi.org/10.1109/HPCS.2018.00163},
  researchr = {https://researchr.org/publication/MyoupoNT18},
  cites = {0},
  citedby = {0},
  pages = {1038-1044},
  booktitle = {2018 International Conference on High Performance Computing & Simulation, HPCS 2018, Orleans, France, July 16-20, 2018},
  publisher = {IEEE},
  isbn = {978-1-5386-7879-4},
}