Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The suffix tree is a very important data structure in string processing, but it suffers from a huge space consumption. In large-scale applications, compressed suffix trees (CSTs) are therefore used instead. A CST consists of three (compressed) components: the suffix array, theLCP-array, and data structures for simulating navigational operations on the suffix tree. TheLCP-array stores the lengths of the longest common prefixes of lexicograph- ically adjacent suffixes, and it can be computed in linear time. ,  present new LCP-array construction algorithms that are fast and very space efficient. In practice, our algorithms outperform the currently best algorithms.
['Simon Gog', 'Enno Ohlebusch']
I am writing a research paper on a idea Lightweight LCP-Array Construction in Linear Time
[{"from": "human", "value": "I am writing a research paper on a idea Lightweight LCP-Array Construction in Linear Time"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The suffix tree is a very important data structure in string processing, but it suffers from a huge space consumption. In large-scale applications, compressed suffix trees (CSTs) are therefore used instead. A CST consists of three (compressed) components: the suffix array, theLCP-array, and data structures for simulating navigational operations on the suffix tree. TheLCP-array stores the lengths of the longest common prefixes of lexicograph- ically adjacent suffixes, and it can be computed in linear time. ,  present new LCP-array construction algorithms that are fast and very space efficient. In practice, our algorithms outperform the currently best algorithms."}]