default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"An Effective Branch-and-Bound Algorithm to Solve the k-Longest Common ..."

Gaofeng Huang, Andrew Lim (2004)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2020-10-05

- no documents available
- export record
  dblp key:
  - conf/ecai/HuangL04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ecai/HuangL04
Gaofeng Huang, Andrew Lim:
An Effective Branch-and-Bound Algorithm to Solve the k-Longest Common Subsequence Problem. ECAI 2004: 191-195

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.