A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem - Archive ouverte HAL Access content directly
Journal Articles Journal of computational science Year : 2020

A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem

Fichier principal
Vignette du fichier
S1877750319301942.pdf (2.01 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03236480 , version 1 (21-07-2022)

Licence

Attribution - NonCommercial

Identifiers

Cite

Armel Nkonjoh Ngomade, Jean-Frédéric Myoupo, Vianney Kengne Tchendji. A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem. Journal of computational science, 2020, 40, pp.101070. ⟨10.1016/j.jocs.2019.101070⟩. ⟨hal-03236480⟩
65 View
63 Download

Altmetric

Share

Gmail Facebook X LinkedIn More