65 citations · 333 across the 44 of their papers we have counts for
8 papers · 1 filter
On the Size of Lempel-Ziv and Lyndon Factorizations
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima +2
Lyndon factorization and Lempel-Ziv (LZ) factorization are both important tools for analysing the structure and complexity of strings, but their combinatorial structure is very dif…
Scalable Similarity Search for Molecular Descriptors
Yasuo Tabei, Simon J. Puglisi
Similarity search over chemical compound databases is a fundamental task in the discovery and design of novel drug-like molecules. Such databases often encode molecules as non-nega…
Scalable Partial Least Squares Regression on Grammar-Compressed Data Matrices
Yasuo Tabei, Hiroto Saigo, Yoshihiro Yamanishi +1
With massive high-dimensional data now commonplace in research and industry, there is a strong and growing demand for more scalable computational techniques for data analysis and k…
String Inference from the LCP Array
Juha Kärkkäinen, Marcin Piątkowski, Simon J. Puglisi
The suffix array, perhaps the most important data structure in modern string processing, is often augmented with the longest common prefix (LCP) array which stores the lengths of t…
RLZAP: Relative Lempel-Ziv with Adaptive Pointers
Anthony J. Cox, Andrea Farruggia, Travis Gagie +2
Relative Lempel-Ziv (RLZ) is a popular algorithm for compressing databases of genomes from individuals of the same species when fast random access is desired. With Kuruppu et al.'s…
Document Retrieval on Repetitive String Collections
Travis Gagie, Aleksi Hartikainen, Kalle Karhu +4
Most of the fastest-growing string collections today are repetitive, that is, most of the constituent documents are similar to many others. As these collections keep growing, a key…