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
