"Subsequences with Gap Constraints: Complexity Bounds for Matching and ..."

Joel D. Day et al. (2022)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ISAAC.2022.64

access: open

type: Conference or Workshop Paper

metadata version: 2022-12-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/isaac/DayKMS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/DayKMS22
Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid:
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. ISAAC 2022: 64:1-64:18

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.