"Polynomial-Time Equivalences and Refined Algorithms for Longest Common ..."

Yuichi Asahiro et al. (2022)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CPM.2022.15

access: open

type: Conference or Workshop Paper

metadata version: 2024-08-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/cpm/Asahiro0LMOU22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/Asahiro0LMOU22
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM 2022: 15:1-15:17

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.