Work

An effective Branch-and-Bound algorithm to solve the k-longest common subsequence problem

Year: 2004

Type: conference-paper

Source: European Conference on Artificial Intelligence

Authors: Gaofeng Huang, Andrew Lim

Institution: Hong Kong University of Science and Technology

Language: English

Topic: Algorithms and Data Compression

Subfield: Theoretical Computer Science

Field: Mathematics

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W32072653

FWCI:

Cites: 44

Cited by: 1

Related to: 10