140 related articles for article (PubMed ID: 30899322)
1. 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]
2. 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]
3. 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]
4. Generalized enhanced suffix array construction in external memory.
Louza FA; Telles GP; Hoffmann S; Ciferri CDA
Algorithms Mol Biol; 2017; 12():26. PubMed ID: 29234460
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. 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]
7. 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]
8. Variable-order reference-free variant discovery with the Burrows-Wheeler Transform.
Prezza N; Pisanti N; Sciortino M; Rosone G
BMC Bioinformatics; 2020 Sep; 21(Suppl 8):260. PubMed ID: 32938358
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. 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]
11. 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]
12. Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform.
Baier U; Beller T; Ohlebusch E
Bioinformatics; 2016 Feb; 32(4):497-504. PubMed ID: 26504144
[TBL] [Abstract][Full Text] [Related]
13. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
[TBL] [Abstract][Full Text] [Related]
14. LSG: An External-Memory Tool to Compute String Graphs for Next-Generation Sequencing Data Assembly.
Bonizzoni P; Vedova GD; Pirola Y; Previtali M; Rizzi R
J Comput Biol; 2016 Mar; 23(3):137-49. PubMed ID: 26953874
[TBL] [Abstract][Full Text] [Related]
15. deGSM: Memory Scalable Construction Of Large Scale de Bruijn Graph.
Guo H; Fu Y; Gao Y; Li J; Wang Y; Liu B
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2157-2166. PubMed ID: 31056509
[TBL] [Abstract][Full Text] [Related]
16. A space and time-efficient index for the compacted colored de Bruijn graph.
Almodaresi F; Sarkar H; Srivastava A; Patro R
Bioinformatics; 2018 Jul; 34(13):i169-i177. PubMed ID: 29949982
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. Computing matching statistics on Wheeler DFAs.
Conte A; Cotumaccio N; Gagie T; Manzini G; Prezza N; Sciortino M
Proc Data Compress Conf; 2023 Mar; 2023():150-159. PubMed ID: 38832320
[TBL] [Abstract][Full Text] [Related]
19. Wheeler graphs: A framework for BWT-based data structures.
Gagie T; Manzini G; Sirén J
Theor Comput Sci; 2017 Oct; 698():67-78. PubMed ID: 29276331
[TBL] [Abstract][Full Text] [Related]
20. A representation of a compressed de Bruijn graph for pan-genome analysis that enables search.
Beller T; Ohlebusch E
Algorithms Mol Biol; 2016; 11():20. PubMed ID: 27437028
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
