"The Longest Common Subsequence Problem for Arc-Annotated Sequences."

Tao Jiang et al. (2000)

> Home

Details and statistics

DOI: 10.1007/3-540-45123-4_15

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cpm/JiangLMZ00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/JiangLMZ00
Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang:
The Longest Common Subsequence Problem for Arc-Annotated Sequences. CPM 2000: 154-165

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.