Simple and fast string algorithms by Lyndon words
-
- Nakashima Yuto
- Principal Investigator
- 九州大学
About this project
- Japan Grant Number
- JP18K18002
- Funding Program
- Grants-in-Aid for Scientific Research
- Funding organization
- Japan Society for the Promotion of Science
- Project/Area Number
- 18K18002
- Research Category
- Grant-in-Aid for Early-Career Scientists
- Allocation Type
-
- Multi-year Fund
- Review Section / Research Field
-
- Basic Section 60010:Theory of informatics-related
- Research Institution
-
- Kyushu University
- Project Period (FY)
- 2018-04-01 〜 2022-03-31
- Project Status
- Completed
- Budget Amount*help
- 4,160,000 Yen (Direct Cost: 3,200,000 Yen Indirect Cost: 960,000 Yen)
Research Abstract
This project aims to develop simple and fast string processing algorithms based on the properties of Lyndon words. To achieve this goal, we have tackled various problems on string processing algorithms and combinatorics on words, such as Lyndon words, repetitive structures, and palindromes. We showed various combinatorial properties on strings and proposed efficient string algorithms using the properties.
Keywords
Details 詳細情報について
-
- CRID
- 1040282256982185344
-
- Text Lang
- ja
-
- Data Source
-
- KAKEN