Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

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

Fichier non déposé

Dates et versions

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

Identifiants

Citer

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⟩
73 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More