OpenAlex | Efficient algorithms for finding a longest common increasing subsequence

Efficient algorithms for finding a longest common increasing subsequence

Work

Year: 2006

Type: article

Source: Journal of Combinatorial Optimization

Authors Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu

Institutions University of Hong Kong, University of Leicester, Fudan University

Cites: 16

Cited by: 29

Related to: 10

FWCI: 1.298

Citation percentile (by year/subfield): 93.47

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed