133 related articles for article (PubMed ID: 37777730)
1. Reference-based genome compression using the longest matched substrings with parallelization consideration.
Lu Z; Guo L; Chen J; Wang R
BMC Bioinformatics; 2023 Sep; 24(1):369. PubMed ID: 37777730
[TBL] [Abstract][Full Text] [Related]
2. High efficiency referential genome compression algorithm.
Shi W; Chen J; Luo M; Chen M
Bioinformatics; 2019 Jun; 35(12):2058-2065. PubMed ID: 30407493
[TBL] [Abstract][Full Text] [Related]
3. ERGC: an efficient referential genome compression algorithm.
Saha S; Rajasekaran S
Bioinformatics; 2015 Nov; 31(21):3468-75. PubMed ID: 26139636
[TBL] [Abstract][Full Text] [Related]
4. Algorithms designed for compressed-gene-data transformation among gene banks with different references.
Luo Q; Guo C; Zhang YJ; Cai Y; Liu G
BMC Bioinformatics; 2018 Jun; 19(1):230. PubMed ID: 29914357
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. Modified HuffBit Compress Algorithm - An Application of R.
Habib N; Ahmed K; Jabin I; Rahman MM
J Integr Bioinform; 2018 Feb; 15(3):. PubMed ID: 29470175
[TBL] [Abstract][Full Text] [Related]
7. SparkGC: Spark based genome compression for large collections of genomes.
Yao H; Hu G; Liu S; Fang H; Ji Y
BMC Bioinformatics; 2022 Jul; 23(1):297. PubMed ID: 35879669
[TBL] [Abstract][Full Text] [Related]
8. A new algorithm for "the LCS problem" with application in compressing genome resequencing data.
Beal R; Afrin T; Farheen A; Adjeroh D
BMC Genomics; 2016 Aug; 17 Suppl 4(Suppl 4):544. PubMed ID: 27556803
[TBL] [Abstract][Full Text] [Related]
9. High-speed and high-ratio referential genome compression.
Liu Y; Peng H; Wong L; Li J
Bioinformatics; 2017 Nov; 33(21):3364-3372. PubMed ID: 28651329
[TBL] [Abstract][Full Text] [Related]
10. Efficient storage of high throughput DNA sequencing data using reference-based compression.
Hsi-Yang Fritz M; Leinonen R; Cochrane G; Birney E
Genome Res; 2011 May; 21(5):734-40. PubMed ID: 21245279
[TBL] [Abstract][Full Text] [Related]
11. A new efficient referential genome compression technique for FastQ files.
Kumar S; Singh MP; Nayak SR; Khan AU; Jain AK; Singh P; Diwakar M; Soujanya T
Funct Integr Genomics; 2023 Nov; 23(4):333. PubMed ID: 37950100
[TBL] [Abstract][Full Text] [Related]
12. Sketch distance-based clustering of chromosomes for large genome database compression.
Tang T; Liu Y; Zhang B; Su B; Li J
BMC Genomics; 2019 Dec; 20(Suppl 10):978. PubMed ID: 31888458
[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. Advances in high throughput DNA sequence data compression.
Sardaraz M; Tahir M; Ikram AA
J Bioinform Comput Biol; 2016 Jun; 14(3):1630002. PubMed ID: 26846812
[TBL] [Abstract][Full Text] [Related]
15. Toward a Better Compression for DNA Sequences Using Huffman Encoding.
Al-Okaily A; Almarri B; Al Yami S; Huang CH
J Comput Biol; 2017 Apr; 24(4):280-288. PubMed ID: 27960065
[TBL] [Abstract][Full Text] [Related]
16. Compression of next-generation sequencing quality scores using memetic algorithm.
Zhou J; Ji Z; Zhu Z; He S
BMC Bioinformatics; 2014; 15 Suppl 15(Suppl 15):S10. PubMed ID: 25474747
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. SeqCompress: an algorithm for biological sequence compression.
Sardaraz M; Tahir M; Ikram AA; Bajwa H
Genomics; 2014 Oct; 104(4):225-8. PubMed ID: 25173568
[TBL] [Abstract][Full Text] [Related]
19. CHAPAO: Likelihood and hierarchical reference-based representation of biomolecular sequences and applications to compressing multiple sequence alignments.
Rahman MA; Tutul AA; Abdullah SM; Bayzid MS
PLoS One; 2022; 17(4):e0265360. PubMed ID: 35436292
[TBL] [Abstract][Full Text] [Related]
20. iDoComp: a compression scheme for assembled genomes.
Ochoa I; Hernaez M; Weissman T
Bioinformatics; 2015 Mar; 31(5):626-33. PubMed ID: 25344501
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
