167 related articles for article (PubMed ID: 25172922)
1. 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]
2. 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]
3. FSG: Fast String Graph Construction for De Novo Assembly.
Bonizzoni P; Vedova GD; Pirola Y; Previtali M; Rizzi R
J Comput Biol; 2017 Oct; 24(10):953-968. PubMed ID: 28715269
[TBL] [Abstract][Full Text] [Related]
4. An improved encoding of genetic variation in a Burrows-Wheeler transform.
Büchler T; Ohlebusch E
Bioinformatics; 2020 Mar; 36(5):1413-1419. PubMed ID: 31613311
[TBL] [Abstract][Full Text] [Related]
5. 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]
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. Disk-based compression of data from genome sequencing.
Grabowski S; Deorowicz S; Roguski Ł
Bioinformatics; 2015 May; 31(9):1389-95. PubMed ID: 25536966
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. TotalReCaller: improved accuracy and performance via integrated alignment and base-calling.
Menges F; Narzisi G; Mishra B
Bioinformatics; 2011 Sep; 27(17):2330-7. PubMed ID: 21724593
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. Encoded expansion: an efficient algorithm to discover identical string motifs.
Azmi AM; Al-Ssulami A
PLoS One; 2014; 9(5):e95148. PubMed ID: 24871320
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. Compression of genomic sequencing reads via hash-based reordering: algorithm and analysis.
Chandak S; Tatwawadi K; Weissman T
Bioinformatics; 2018 Feb; 34(4):558-567. PubMed ID: 29444237
[TBL] [Abstract][Full Text] [Related]
14. Ultrafast SNP analysis using the Burrows-Wheeler transform of short-read data.
Kimura K; Koike A
Bioinformatics; 2015 May; 31(10):1577-83. PubMed ID: 25609790
[TBL] [Abstract][Full Text] [Related]
15. A survey of BWT variants for string collections.
Cenzato D; Lipták Z
Bioinformatics; 2024 May; ():. PubMed ID: 38788221
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. Using reference-free compressed data structures to analyze sequencing reads from thousands of human genomes.
Dolle DD; Liu Z; Cotten M; Simpson JT; Iqbal Z; Durbin R; McCarthy SA; Keane TM
Genome Res; 2017 Feb; 27(2):300-309. PubMed ID: 27986821
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. Index suffix-prefix overlaps by (w, k)-minimizer to generate long contigs for reads compression.
Liu Y; Yu Z; Dinger ME; Li J
Bioinformatics; 2019 Jun; 35(12):2066-2074. PubMed ID: 30407482
[TBL] [Abstract][Full Text] [Related]
20. SCALCE: boosting sequence compression algorithms using locally consistent encoding.
Hach F; Numanagic I; Alkan C; Sahinalp SC
Bioinformatics; 2012 Dec; 28(23):3051-7. PubMed ID: 23047557
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
