"A fast and simple algorithm for computing the longest common subsequence ..."

Hsing-Yen Ann et al. (2008)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2008.07.005

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/AnnYTH08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/AnnYTH08
Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor:
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings. Inf. Process. Lett. 108(6): 360-364 (2008)

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.