Longest bordered and periodic subsequences
Work
Year: 2023
Type: article
Abstract: We present an algorithm computing the longest periodic subsequence of a string of length n in O(n7) time with O(n3) space. We obtain improvements when restricting the exponents or extending the search... more
Source: Information Processing Letters
Authors Hideo Bannai, I Tomohiro, Dominik Köppl
Institutions Tokyo Medical and Dental University, Kyushu Art Institute of Technology, Kyushu Institute of Technology, University of Münster
Cites: 15
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,200
Funders Japan Society for the Promotion of Science, Japan Society for the Promotion of Science, Japan Society for the Promotion of Science, Japan Society for the Promotion of Science, Japan Society for the Promotion of Science
Grant IDS JP22H03551, JP21K17701, JP19K20213, JP23H04378, JP20H04141