"Efficient CGM-based parallel algorithms for the longest common subsequence ..."

Vianney Kengne Tchendji et al. (2020)

> Home

Details and statistics

DOI: 10.1016/J.PARCO.2019.102598

access: closed

type: Journal Article

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pc/TchendjiNZM20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/TchendjiNZM20
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 Comput. 91 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.