"Efficient algorithms for finding a longest common increasing subsequence."

Wun-Tat Chan et al. (2007)

> Home

Details and statistics

DOI: 10.1007/S10878-006-9031-7

access: closed

type: Journal Article

metadata version: 2020-05-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/ChanZFYZ07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/ChanZFYZ07
Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu:
Efficient algorithms for finding a longest common increasing subsequence. J. Comb. Optim. 13(3): 277-288 (2007)

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.