Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints - Archive ouverte HAL Access content directly
Journal Articles Parallel Computing Year : 2020

Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints

No file

Dates and versions

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

Identifiers

Cite

Vianney Kengne Tchendji, Armel Nkonjoh Ngomade, Jerry Lacmou Zeutouo, Jean-Frédéric Myoupo. Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints. Parallel Computing, 2020, 91, pp.102598. ⟨10.1016/j.parco.2019.102598⟩. ⟨hal-03236493⟩
70 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More