External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Solving longest common subsequence problems via a transformation to the maximum clique problem

Christian Blum 0001, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu Min Li, Felip Manyà, Günter R. Raidl. Solving longest common subsequence problems via a transformation to the maximum clique problem. Computers & OR, 125:105089, 2021. [doi]

Authors

Christian Blum 0001

This author has not been identified. Look up 'Christian Blum 0001' in Google

Marko Djukanovic

This author has not been identified. Look up 'Marko Djukanovic' in Google

Alberto Santini

This author has not been identified. Look up 'Alberto Santini' in Google

Hua Jiang

This author has not been identified. Look up 'Hua Jiang' in Google

Chu Min Li

This author has not been identified. Look up 'Chu Min Li' in Google

Felip Manyà

This author has not been identified. Look up 'Felip Manyà' in Google

Günter R. Raidl

This author has not been identified. Look up 'Günter R. Raidl' in Google
runs on