"A fast algorithm for the longest-common-subsequence problem."

Amar Mukhopadhyay (1980)

> Home

Details and statistics

DOI: 10.1016/0020-0255(80)90025-0

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/isci/Mukhopadhyay80
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/isci/Mukhopadhyay80
Amar Mukhopadhyay:
A fast algorithm for the longest-common-subsequence problem. Inf. Sci. 20(1): 69-82 (1980)

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.