Felipe Alves da Louza

  • Citations Per Year
Learn More
Introduction Suffix and LCP arrays Provide an efficent data structure to solve many string problems Several algorithms have been proposed to construct suffix and LCP arrays in external memory e.g. Indexing string sets To use those algorithms it would be necessary to concatenate all strings into a single one T = T 1 $ 1 T 2 $ 2. .. T k $ k with different(More)
Sorting all suffixes of a string collection may be performed by sorting the concatenation of all strings using different end marker symbols as separators, or alternatively using the same end marker as separator. However, both approaches have the following drawbacks. The first alternative increases the alphabet size of the resulting string by the number of(More)
In this paper we present an algorithm to compute the Lyndon array of a string T of length n as a byproduct of the inversion of the Burrows-Wheeler transform of T . Our algorithm runs in linear time using only a stack in addition to the data structures used for Burrows-Wheeler inversion. We compare our algorithm with two other linear-time algorithms for(More)
A time series is a collection of measurements made sequentially over time. Time series appear in various application such as finance, marketing, agriculture, weather and industrial and scientific data gathering. Similarity searching over time series databases is an important tool to extract knowledge. In this paper, we propose Telesto, a novel indexing(More)