"The Complexity of Maximal Common Subsequence Enumeration."

Giovanni Buzzega et al. (2025)

> Home

Details and statistics

DOI: 10.1145/3725252

access: closed

type: Journal Article

metadata version: 2025-08-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pacmmod/BuzzegaCKKP25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pacmmod/BuzzegaCKKP25
Giovanni Buzzega, Alessio Conte, Yasuaki Kobayashi, Kazuhiro Kurita, Giulia Punzi:
The Complexity of Maximal Common Subsequence Enumeration. Proc. ACM Manag. Data 3(2): 115:1-115:19 (2025)

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.