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 (HPCS, 2018)

A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem. - Armel Nkonjoh Ngomade; Jean Frédéric Myoupo; Vianney Kengne Tchendji (J. Comput. Sci., 2020)

Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints. - Vianney Kengne Tchendji; Armel Nkonjoh Ngomade; Jerry Lacmou Zeutouo; Jean Frédéric Myoupo (Parallel Comput., 2020)

Dominant Point-Based Sequential and Parallel Algorithms for the Multiple Sequential Substring Constrained-LCS Problem. - Hermann Bogning Tepiele; Vianney Kengne Tchendji; Mathias Akong Onabid; Jean Frédéric Myoupo; Armel Nkonjoh Ngomade (ACM Trans. Parallel Comput., 2024)