Genome biology · 2022 · 54 citations · 70 references
Life SciencesBioinformaticsComputational BiologyGenomic Data AnalysisGenomicsComputational GenomicsDna SequencingGenome SequencingNext-generation SequencingNext-generation Sequencing Data Analysis
The de Bruijn graph is a key data structure in modern computational genomics, and construction of its compacted variant resides upstream of many genomic analyses. As the quantity of genomic data grows rapidly, this often forms a computational bottleneck. We present Cuttlefish 2, significantly advancing the state-of-the-art for this problem. On a commodity server, it reduces the graph construction time for 661K bacterial genomes, of size 2.58Tbp, from 4.5 days to 17-23 h; and it constructs the graph for 1.52Tbp white spruce reads in approximately 10 h, while the closest competitor requires 54-58 h, using considerably more memory.
70
Full-length transcriptome assembly from RNA-Seq data without a reference genome
Manfred Grabherr, Brian J. Haas, Moran Yassour et al. · Nature Biotechnology · 2011 · 22.6K citations · Full text
Near-optimal probabilistic RNA-seq quantification
Nicolas Bray, Harold Pimentel, Páll Melsted et al. · Nature Biotechnology · 2016 · 11K citations · Full text
Space/time trade-offs in hash coding with allowable errors
Burton H. Bloom · Communications of the ACM · 1970 · 7.5K citations · Full text