2 papers
cs.DS2020
PFP Data Structures
Christina Boucher, Ondřej Cvacho, Travis Gagie +4
Prefix-free parsing (PFP) was introduced by Boucher et al. (2019) as a preprocessing step to ease the computation of Burrows-Wheeler Transforms (BWTs) of genomic databases. Given a…
cs.DS2019
Data structures to represent a set of k-long DNA sequences
Rayan Chikhi, Jan Holub, Paul Medvedev
The analysis of biological sequencing data has been one of the biggest applications of string algorithms. The approaches used in many such applications are based on the analysis of…