"Computing Longest Common Substring/Subsequence of Non-linear Texts."

Kouji Shimohira et al. (2011)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-10

- view
  - electronic edition @ stringology.org (open access)
- export record
  dblp key:
  - conf/stringology/ShimohiraIBT11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stringology/ShimohiraIBT11
Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Longest Common Substring/Subsequence of Non-linear Texts. Stringology 2011: 197-208

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.