"Efficient Algorithms for Finding a Longest Common Increasing Subsequence."

Wun-Tat Chan et al. (2005)

> Home

Details and statistics

DOI: 10.1007/11602613_67

access: closed

type: Conference or Workshop Paper

metadata version: 2020-05-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/ChanZFYZ05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/ChanZFYZ05
Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu:
Efficient Algorithms for Finding a Longest Common Increasing Subsequence. ISAAC 2005: 665-674

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.