Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present efficient algorithms computing all Abelian periods of two types in a word. Regular Abelian periods are computed in O(n log log{n}) randomized time which improves over the best previously known algorithm by almost a factor of n. The other algorithm, for full Abelian periods, works in O(n) time. As a tool  develop an O(n) time construction of a data structure that allows O(1) time gcd(i,j) queries for all 1 <= i,j <= n, this is a result of independent interest.
['Tomasz Kociumaka', 'Jakub Radoszewski', 'Wojciech Rytter']
I am writing a research paper on a idea Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries
[{"from": "human", "value": "I am writing a research paper on a idea Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present efficient algorithms computing all Abelian periods of two types in a word. Regular Abelian periods are computed in O(n log log{n}) randomized time which improves over the best previously known algorithm by almost a factor of n. The other algorithm, for full Abelian periods, works in O(n) time. As a tool  develop an O(n) time construction of a data structure that allows O(1) time gcd(i,j) queries for all 1 <= i,j <= n, this is a result of independent interest."}]