Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences

Bannai, H; Tomohiro, I; Kociumaka, T; Köppl, D; Puglisi, SJ

Köppl, D (通讯作者)，Tokyo Med & Dent Univ, M&D Data Sci Ctr, Tokyo, Japan.;Köppl, D (通讯作者)，Univ Munster, Dept Comp Sci, Munster, Germany.

ALGORITHMICA, 2023; ():

Abstract

Given a string T of length n whose characters are drawn from an ordered alphabet of size s, its longest Lyndon subsequence is a maximum-length subsequ......

Full Text Link


Links

期刊讨论 | 中国SCI论文 | 期刊主页 | 投稿经验 | 杂志官网 | 投稿链接 | 作者需知 | PMC链接 | Pubmed全文检索