"Computing Longest Common Subsequence Under Cartesian-Tree Matching Model."

Taketo Tsujimoto et al. (2024)

> Home

Details and statistics

DOI: 10.1007/978-3-031-63021-7_28

access: closed

type: Conference or Workshop Paper

metadata version: 2024-08-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iwoca/TsujimotoSMNI24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/TsujimotoSMNI24
Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. IWOCA 2024: 369-381

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.