Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint - Archive ouverte HAL
Conference Papers Year : 2018

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

Jean-Frédéric Myoupo
Modélisation, Information et Systèmes - UR UPJV 4290
CV
Armel Nkonjoh Ngomade
  • Function : Author
Vianney Kengne Tchendji
  • Function : Author

Domains

Computer Science [cs]

Alain Cournier  : Connect in order to contact the contributor

https://hal.science/hal-03237774

Submitted on : Wednesday, May 26, 2021-6:12:58 PM

Last modification on : Tuesday, July 30, 2024-12:40:03 PM

No file

Dates and versions

hal-03237774 , version 1 (26-05-2021)

Identifiers

Cite

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. 2018 International Conference on High Performance Computing & Simulation (HPCS), Jul 2018, Orleans, France. pp.1038-1044, ⟨10.1109/HPCS.2018.00163⟩. ⟨hal-03237774⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

U-PICARDIE MIS UPJV-MIS-SDMA
76 View
0 Download

Altmetric

Share

More