Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  describe a RAM algorithm computing all runs (maximal repetitions) of a given string of length n over a general ordered alphabet in O ( n log 2 3 ? n ) time and linear space. Our algorithm outperforms all known solutions working in ? ( n log ? ? ) time provided ? = n ? ( 1 ) , where ? is the alphabet size.  conjecture that there exists a linear time RAM algorithm finding all runs.  connect the longest common extension (LCE) problem with the runs computation.On a general ordered alphabets, all known LCE require O ( n log ? n ) preprocessing.Fast LCE on a general alphabet implies a fast runs computation. construct an algorithm that computes O ( n ) LCE queries in O ( n ( log ? n ) 2 3 ) time.Using the fast LCE,  compute all runs in O ( n ( log ? n ) 2 3 ) time.
['Dmitry Kosolobov']
I am writing a research paper on a idea Computing runs on a general alphabet
[{"from": "human", "value": "I am writing a research paper on a idea Computing runs on a general alphabet"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  describe a RAM algorithm computing all runs (maximal repetitions) of a given string of length n over a general ordered alphabet in O ( n log 2 3 ? n ) time and linear space. Our algorithm outperforms all known solutions working in ? ( n log ? ? ) time provided ? = n ? ( 1 ) , where ? is the alphabet size.  conjecture that there exists a linear time RAM algorithm finding all runs.  connect the longest common extension (LCE) problem with the runs computation.On a general ordered alphabets, all known LCE require O ( n log ? n ) preprocessing.Fast LCE on a general alphabet implies a fast runs computation. construct an algorithm that computes O ( n ) LCE queries in O ( n ( log ? n ) 2 3 ) time.Using the fast LCE,  compute all runs in O ( n ( log ? n ) 2 3 ) time."}]