English
Related papers

Related papers: Variant tolerant read mapping using min-hashing

200 papers

There are currently plenty of programs available for mapping short sequences (reads) to a genome. Most of them, however, including such popular and actively developed programs as Bowtie, BWA, TopHat and many others, are based on…

Genomics · Quantitative Biology 2019-08-06 Igor Seledtsov , Jaroslav Efremov , Vladimir Molodtsov , Victor Solovyev

DNA sequencing is the physical/biochemical process of identifying the location of the four bases (Adenine, Guanine, Cytosine, Thymine) in a DNA strand. As semiconductor technology revolutionized computing, modern DNA sequencing technology…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-06 S. Karen Khatamifard , Zamshed Chowdhury , Nakul Pande , Meisam Razaviyayn , Chris Kim , Ulya R. Karpuzcu

Genome analysis has revolutionized fields such as personalized medicine and forensics. Modern sequencing machines generate vast amounts of fragmented strings of genome data called reads. The alignment of these reads into a complete DNA…

Hardware Architecture · Computer Science 2024-11-22 Rotem Ben-Hur , Orian Leitersdorf , Ronny Ronen , Lidor Goldshmidt , Idan Magram , Lior Kaplun , Leonid Yavitz , Shahar Kvatinsky

Motivation: Seed filtering is critical in DNA read mapping, a process where billions of DNA fragments (reads) sampled from a donor are mapped onto a reference genome to identify genomic variants of the donor. Read mappers 1) quickly…

This paper presents an accurate short-read mapper for next-generation sequencing data which is widely used in the 1000 Genomes Project, and human clinical and other species genome studies.

Genomics · Quantitative Biology 2015-06-17 Wan-Ping Lee , Michael Stromberg , Alistair Ward , Chip Stewart , Erik Garrison , Gabor T. Marth

Motivation: Seed location filtering is critical in DNA read mapping, a process where billions of DNA fragments (reads) sampled from a donor are mapped onto a reference genome to identify genomic variants of the donor. State-of-the-art read…

Motivation: High throughput DNA sequencing (HTS) technologies generate an excessive number of small DNA segments -- called short reads -- that cause significant computational burden. To analyze the entire genome, each of the billions of…

Genomics · Quantitative Biology 2020-09-29 Mohammed Alser , Hasan Hassan , Hongyi Xin , Oğuz Ergin , Onur Mutlu , Can Alkan

Background: While benchmarks on short-read variant calling suggest low error rate below 0.5%, they are only applicable to predefined confident regions. For a human sample without such regions, the error rate could be 10 times higher.…

Genomics · Quantitative Biology 2025-09-23 Heng Li

Huge numbers of short reads are being generated for mapping back to the genome to discover the frequency of transcripts, miRNAs, DNAase hypersensitive sites, FAIRE regions, nucleosome occupancy, etc. Since these reads are typically short…

Genomics · Quantitative Biology 2009-12-31 Peter J. Waddell , Timothy Herston

Bam-readcount is a utility for generating low-level information about sequencing data at specific nucleotide positions. Originally designed to help filter genomic mutation calls, the metrics it outputs are useful as input for variant…

DNA read mapping is a computationally expensive bioinformatics task, required for genome assembly and consensus polishing. It requires to find the best-fitting location for each DNA read on a long reference sequence. A novel resistive…

Genomics · Quantitative Biology 2019-01-29 Roman Kaplan , Leonid Yavits , Ran Ginosar

Variant calling refinement is crucial for distinguishing true genetic variants from technical artifacts in high-throughput sequencing data. Manual review is time-consuming while heuristic filtering often lacks optimal solutions. Traditional…

Genomics · Quantitative Biology 2024-08-02 Omar Abdelwahab , Davoud Torkamaneh

Wastewater-based genomic surveillance has emerged as a powerful tool for population-level viral monitoring, offering comprehensive insights into circulating viral variants across entire communities. However, this approach faces significant…

Machine Learning · Computer Science 2025-12-04 Adele Chinda , Richmond Azumah , Hemanth Demakethepalli Venkateswara

Genome assembly from the high-throughput sequencing (HTS) reads is a fundamental yet challenging computational problem. An intrinsic challenge is the uncertainty caused by the widespread repetitive elements. Here we get around the…

Genomics · Quantitative Biology 2016-09-13 Anqi Wang , Zheng Li , Zhanyu Wang , Lei M. Li

Typical large-scale recommender systems use deep learning models that are stored on a large amount of DRAM. These models often rely on embeddings, which consume most of the required memory. We present Bandana, a storage system that reduces…

Machine Learning · Computer Science 2018-11-16 Assaf Eisenman , Maxim Naumov , Darryl Gardner , Misha Smelyanskiy , Sergey Pupyrev , Kim Hazelwood , Asaf Cidon , Sachin Katti

Next-generation sequencing technologies generate millions of short sequence reads, which are usually aligned to a reference genome. In many applications, the key information required for downstream analysis is the number of reads mapping to…

Genomics · Quantitative Biology 2016-07-26 Yang Liao , Gordon K Smyth , Wei Shi

Genome analysis fundamentally starts with a process known as read mapping, where sequenced fragments of an organism's genome are compared against a reference genome. Read mapping is currently a major bottleneck in the entire genome analysis…

Hardware Architecture · Computer Science 2020-10-29 Mohammed Alser , Zülal Bingöl , Damla Senol Cali , Jeremie Kim , Saugata Ghose , Can Alkan , Onur Mutlu

Motivation: High-coverage sequencing data have significant, yet hard to exploit, redundancy. Most FASTQ compressors cannot efficiently compress the DNA stream of large datasets, since the redundancy between overlapping reads cannot be…

Data Structures and Algorithms · Computer Science 2014-09-19 Szymon Grabowski , Sebastian Deorowicz , Łukasz Roguski

We explore the application of Vision Transformer (ViT) for handwritten text recognition. The limited availability of labeled data in this domain poses challenges for achieving high performance solely relying on ViT. Previous…

Computer Vision and Pattern Recognition · Computer Science 2024-09-16 Yuting Li , Dexiong Chen , Tinglong Tang , Xi Shen

Approximate Nearest Neighbour (ANN) search is a fundamental problem in information retrieval, underpinning large-scale applications in computer vision, natural language processing, and cross-modal search. Hashing-based methods provide an…

Information Retrieval · Computer Science 2025-10-07 Sean Moran
‹ Prev 1 2 3 10 Next ›