2 papers
cs.DS2018
The colored longest common prefix array computed via sequential scans
F. Garofalo, G. Rosone, M. Sciortino +1
Due to the increased availability of large datasets of biological sequences, the tools for sequence comparison are now relying on efficient alignment-free approaches to a greater e…
cs.DS2016
Lightweight LCP Construction for Very Large Collections of Strings
Anthony J. Cox, Fabio Garofalo, Giovanna Rosone +1
The longest common prefix array is a very advantageous data structure that, combined with the suffix array and the Burrows-Wheeler transform, allows to efficiently compute some com…