"Beyond the Longest Letter-Duplicated Subsequence Problem."

Wenfeng Lai et al. (2022)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CPM.2022.7

access: open

type: Conference or Workshop Paper

metadata version: 2022-06-22

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/cpm/LaiLZZ22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/LaiLZZ22
Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou:
Beyond the Longest Letter-Duplicated Subsequence Problem. CPM 2022: 7:1-7:12

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.