A CGM-Based Parallel Algorithm Using the Four-Russians Speedup for the 1-D Sequence Alignment Problem

Autor: Lacmou Zeutouo, Jerry, Tessa Masse, Grace Colette, KAMGA YOUMBI, Franklin Ingrid

Publikováno v: CARI 2020-Colloque Africain pour la Recherche en Informatique et Mathématiques Appliquées
CARI 2020-Colloque Africain pour la Recherche en Informatique et Mathématiques Appliquées, Oct 2020, Thiès, Senegal

The CGM model is one of the most widely used models for the design of parallel algorithms. It has shown its efficiency in solving several problems modeled by dynamic programming such as the longest common subsequence problem, which is a special case

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3ca1446f138e4d79f570c6c34c5abdc6
https://hal.archives-ouvertes.fr/hal-02925791