Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A longest repeat query on a string, motivated by its applications in many subfields including computational biology, asks for the longest repetitive substrings covering a particular string position point query. ,  extend the point query to interval query, allowing the search for longest repeats covering any position interval. Our method for interval query takes a different approach using the insight from a recent work on shortest unique substrings, as the prior work's approach for point query becomes infeasible in the setting of interval query.  propose an indexing structure, which can be constructed in the optimal On time and space for a string of size n, such that any future interval query can be ansred in O1 time. Further, our solution can find all longest repeats covering any given interval using optimal Oocc time, where occ is the number of longest repeats covering that given interval.
['Bojian Xu']
I am writing a research paper on a idea On stabbing queries for generalised longest repeats
[{"from": "human", "value": "I am writing a research paper on a idea On stabbing queries for generalised longest repeats"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A longest repeat query on a string, motivated by its applications in many subfields including computational biology, asks for the longest repetitive substrings covering a particular string position point query. ,  extend the point query to interval query, allowing the search for longest repeats covering any position interval. Our method for interval query takes a different approach using the insight from a recent work on shortest unique substrings, as the prior work's approach for point query becomes infeasible in the setting of interval query.  propose an indexing structure, which can be constructed in the optimal On time and space for a string of size n, such that any future interval query can be ansred in O1 time. Further, our solution can find all longest repeats covering any given interval using optimal Oocc time, where occ is the number of longest repeats covering that given interval."}]