These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
151 related articles for article (PubMed ID: 33118018)
1. Allowing mutations in maximal matches boosts genome compression performance. Liu Y; Wong L; Li J Bioinformatics; 2020 Sep; 36(18):4675-4681. PubMed ID: 33118018 [TBL] [Abstract][Full Text] [Related]
2. 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]
3. 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]
4. Fast detection of maximal exact matches via fixed sampling of query K-mers and Bloom filtering of index K-mers. Liu Y; Zhang LY; Li J Bioinformatics; 2019 Nov; 35(22):4560-4567. PubMed ID: 30994891 [TBL] [Abstract][Full Text] [Related]
5. 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]
6. 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]
8. copMEM: finding maximal exact matches via sampling both genomes. Grabowski S; Bieniecki W Bioinformatics; 2019 Feb; 35(4):677-678. PubMed ID: 30060142 [TBL] [Abstract][Full Text] [Related]
9. SPRING: a next-generation compressor for FASTQ data. Chandak S; Tatwawadi K; Ochoa I; Hernaez M; Weissman T Bioinformatics; 2019 Aug; 35(15):2674-2676. PubMed ID: 30535063 [TBL] [Abstract][Full Text] [Related]
10. 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]
11. 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]
12. RENANO: a REference-based compressor for NANOpore FASTQ files. Dufort Y Álvarez G; Seroussi G; Smircich P; Sotelo-Silveira J; Ochoa I; Martín Á Bioinformatics; 2021 Dec; 37(24):4862-4864. PubMed ID: 34128963 [TBL] [Abstract][Full Text] [Related]
13. A randomized optimal k-mer indexing approach for efficient parallel genome sequence compression. Roy S; Mukhopadhyay A Gene; 2024 May; 907():148235. PubMed ID: 38342250 [TBL] [Abstract][Full Text] [Related]
14. Nucleotide Archival Format (NAF) enables efficient lossless reference-free compression of DNA sequences. Kryukov K; Ueda MT; Nakagawa S; Imanishi T Bioinformatics; 2019 Oct; 35(19):3826-3828. PubMed ID: 30799504 [TBL] [Abstract][Full Text] [Related]