In this paper, we present new LCP-array construction algorithms that are fast and very space efficient. In practice, our algorithms outperform the currently ...
Fast and Lightweight LCP-Array Construction Algorithms. Simon Gog ∗. Enno ... In this paper, we present new LCP-array construction algorithms that are fast and.
In this paper, we present new LCP-array construction algorithms that are fast and very space efficient. In practice, our algorithms outperform the currently ...
This paper presents new LCP-array construction algorithms that are fast and very space efficient, and outperform the currently best algorithms on large ...
/*! The algorithm computes the lcp array and stores it to disk. * \pre Text and Suffix array exist in the cache.
algorithm which is fast and “lightweight” in the sense that it uses small space. The suffix array consists of n integers in the range [1,n]. This means that ...
Dec 20, 2010 · In this paper, we present new LCP-array construction algorithms that are fast and very space efficient. In practice, our algorithms outperform ...
People also ask
Which is the fastest suffix array construction?
What is LCP in algorithms?
What is the time complexity of Kasai's algorithm?
What is the LCP data structure?
The key idea of the algorithm is to first sort a sample of suffixes chosen using mathematical constructs called difference covers. The algorithm is not only ...
This solves the open problem stated by Manzini and Ferragina [ESA '02] of whether there exists a lightweight (sublinear extra space) O(n log n) time algorithm.
As of 2012, the currently fastest linear-time LCP array construction algorithm is due to Fischer (2011), which in turn is based on one of the fastest suffix ...