"Computing Maximal Lyndon Substrings of a String."

Frantisek Franek, Michael Liut (2020)

> Home

Details and statistics

DOI: 10.3390/A13110294

access: open

type: Journal Article

metadata version: 2021-09-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithms/FranekL20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithms/FranekL20
Frantisek Franek, Michael Liut:
Computing Maximal Lyndon Substrings of a String. Algorithms 13(11): 294 (2020)

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.