PFP Compressed Suffix Trees.
Journal
Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX
ISSN: 2164-0300
Titre abrégé: Proc Worksh Algorithm Eng Exp
Pays: United States
ID NLM: 9918250306906676
Informations de publication
Date de publication:
2021
2021
Historique:
entrez:
31
3
2022
pubmed:
1
1
2021
medline:
1
1
2021
Statut:
ppublish
Résumé
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
Identifiants
pubmed: 35355938
doi: 10.1137/1.9781611976472.5
pmc: PMC8963198
mid: NIHMS1739423
doi:
Types de publication
Journal Article
Langues
eng
Pagination
60-72Subventions
Organisme : NIAID NIH HHS
ID : R01 AI141810
Pays : United States
Organisme : NHGRI NIH HHS
ID : R01 HG011392
Pays : United States
Références
J Comput Biol. 2010 Mar;17(3):281-308
pubmed: 20377446
Algorithms Mol Biol. 2019 May 24;14:13
pubmed: 31149025
Brief Bioinform. 2018 Jan 1;19(1):118-135
pubmed: 27769991
Front Microbiol. 2017 May 09;8:808
pubmed: 28536563
J Comput Biol. 2020 Apr;27(4):500-513
pubmed: 32181684
Nature. 2015 Oct 1;526(7571):68-74
pubmed: 26432245