Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences

Bannai, Hideo; Tomohiro, I.; Kociumaka, Tomasz; Koeppl, Dominik; Puglisi, Simon J.

doi:10.1007/s00453-023-01125-z

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences

MPS-Authors

/persons/resource/persons284929

Kociumaka, Tomasz
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

s00453-023-01125-z.pdf
(Publisher version), 630KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Bannai, H., Tomohiro, I., Kociumaka, T., Koeppl, D., & Puglisi, S. J. (2023). Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica. doi:10.1007/s00453-023-01125-z.

Cite as: https://hdl.handle.net/21.11116/0000-000D-3FF3-B

Abstract

There is no abstract available