PFP Compressed Suffix Trees
Work
Year: 2021
Type: article
Abstract: 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 string S, it produc... more
Institutions University of Florida, Czech Technical University in Prague, Dalhousie University, Università degli Studi del Piemonte Orientale “Amedeo Avogadro”, University of Chile
Cites: 32
Cited by: 13
Related to: 10
FWCI: 1.441
Citation percentile (by year/subfield): 86
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze