154 related articles for article (PubMed ID: 31149025)
1. Prefix-free parsing for building big BWTs.
Boucher C; Gagie T; Kuhnle A; Langmead B; Manzini G; Mun T
Algorithms Mol Biol; 2019; 14():13. PubMed ID: 31149025
[TBL] [Abstract][Full Text] [Related]
2. Recursive Prefix-Free Parsing for Building Big BWTs.
Oliva M; Gagie T; Boucher C
bioRxiv; 2023 Jan; ():. PubMed ID: 36712109
[TBL] [Abstract][Full Text] [Related]
3. PFP Compressed Suffix Trees.
Boucher C; Cvacho O; Gagie T; Holub J; Manzini G; Navarro G; Rossi M
Proc Worksh Algorithm Eng Exp; 2021; 2021():60-72. PubMed ID: 35355938
[TBL] [Abstract][Full Text] [Related]
4. External memory BWT and LCP computation for sequence collections with applications.
Egidi L; Louza FA; Manzini G; Telles GP
Algorithms Mol Biol; 2019; 14():6. PubMed ID: 30899322
[TBL] [Abstract][Full Text] [Related]
5. Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform.
Cox AJ; Bauer MJ; Jakobi T; Rosone G
Bioinformatics; 2012 Jun; 28(11):1415-9. PubMed ID: 22556365
[TBL] [Abstract][Full Text] [Related]
6. Efficient Construction of a Complete Index for Pan-Genomics Read Alignment.
Kuhnle A; Mun T; Boucher C; Gagie T; Langmead B; Manzini G
J Comput Biol; 2020 Apr; 27(4):500-513. PubMed ID: 32181684
[No Abstract] [Full Text] [Related]
7. MONI: A Pangenomic Index for Finding Maximal Exact Matches.
Rossi M; Oliva M; Langmead B; Gagie T; Boucher C
J Comput Biol; 2022 Feb; 29(2):169-187. PubMed ID: 35041495
[TBL] [Abstract][Full Text] [Related]
8. Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing.
Kempa D; Langmead B
Lebniz Int Proc Inform; 2021; 204():. PubMed ID: 37906626
[TBL] [Abstract][Full Text] [Related]
9. Multithread Multistring Burrows-Wheeler Transform and Longest Common Prefix Array.
Bonizzoni P; Della Vedova G; Pirola Y; Previtali M; Rizzi R
J Comput Biol; 2019 Sep; 26(9):948-961. PubMed ID: 31140836
[No Abstract] [Full Text] [Related]
10. Computing the original eBWT faster, simpler, and with less memory.
Boucher C; Cenzato D; Lipták Z; Rossi M; Sciortino M
Int Symp String Process Inf Retr; 2021 Oct; 12944():129-142. PubMed ID: 38742019
[TBL] [Abstract][Full Text] [Related]
11. Parallel Computation of the Burrows-Wheeler Transform of Short Reads Using Prefix Parallelism.
Kimura K; Koike A
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):3-13. PubMed ID: 29994538
[TBL] [Abstract][Full Text] [Related]
12. Merging of multi-string BWTs with applications.
Holt J; McMillan L
Bioinformatics; 2014 Dec; 30(24):3524-31. PubMed ID: 25172922
[TBL] [Abstract][Full Text] [Related]
13. r-indexing the eBWT.
Boucher C; Cenzato D; Lipták Z; Rossi M; Sciortino M
Int Symp String Process Inf Retr; 2021 Oct; 12944():3-12. PubMed ID: 38742018
[TBL] [Abstract][Full Text] [Related]
14. Parallel and Space-Efficient Construction of Burrows-Wheeler Transform and Suffix Array for Big Genome Data.
Liu Y; Hankeln T; Schmidt B
IEEE/ACM Trans Comput Biol Bioinform; 2016; 13(3):592-8. PubMed ID: 27295644
[TBL] [Abstract][Full Text] [Related]
15. deBWT: parallel construction of Burrows-Wheeler Transform for large collection of genomes with de Bruijn-branch encoding.
Liu B; Zhu D; Wang Y
Bioinformatics; 2016 Jun; 32(12):i174-i182. PubMed ID: 27307614
[TBL] [Abstract][Full Text] [Related]
16. An Upper Bound and Linear-Space Queries on the LZ-End Parsing.
Kempa D; Saha B
Proc Annu ACM SIAM Symp Discret Algorithms; 2022; 2022():2847-2866. PubMed ID: 38831952
[TBL] [Abstract][Full Text] [Related]
17. gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections.
Louza FA; Telles GP; Gog S; Prezza N; Rosone G
Algorithms Mol Biol; 2020; 15():18. PubMed ID: 32973918
[TBL] [Abstract][Full Text] [Related]
18. Compressed indexing and local alignment of DNA.
Lam TW; Sung WK; Tam SL; Wong CK; Yiu SM
Bioinformatics; 2008 Mar; 24(6):791-7. PubMed ID: 18227115
[TBL] [Abstract][Full Text] [Related]
19. Pfp-fm: an accelerated FM-index.
Hong A; Oliva M; Köppl D; Bannai H; Boucher C; Gagie T
Algorithms Mol Biol; 2024 Apr; 19(1):15. PubMed ID: 38600518
[TBL] [Abstract][Full Text] [Related]
20. Efficient haplotype matching and storage using the positional Burrows-Wheeler transform (PBWT).
Durbin R
Bioinformatics; 2014 May; 30(9):1266-72. PubMed ID: 24413527
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
