English
Related papers

Related papers: On the Coverage Required for Diploid Genome Assemb…

200 papers

It is not known how a cell manages to find a specific DNA sequence sufficiently fast to repair a broken chromosome through homologous recombination. I propose that the solution is based on a parallelized search implemented by freely…

Other Quantitative Biology · Quantitative Biology 2016-08-25 Johan Elf

DNA self-assembly is an important tool that has a wide range of applications such as building nanostructures, the transport of target virotherapies, and nano-circuitry. Tools from graph theory can be used to encode the biological process of…

Combinatorics · Mathematics 2023-10-09 Cory Johnson , Andrew Lavengood-Ryan

The graph projection of a hypergraph is a simple graph with the same vertex set and with an edge between each pair of vertices that appear in a hyperedge. We consider the problem of reconstructing a random $d$-uniform hypergraph from its…

Statistics Theory · Mathematics 2025-02-14 Guy Bresler , Chenghao Guo , Yury Polyanskiy

The 3-dimensional (3D) structure of the genome is of significant importance for many cellular processes. In this paper, we study the problem of reconstructing the 3D structure of chromosomes from Hi-C data of diploid organisms, which poses…

Genomics · Quantitative Biology 2024-05-30 Diego Cifuentes , Jan Draisma , Oskar Henriksson , Annachiara Korchmaros , Kaie Kubjas

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

We wish to measure the information coverage of an ad hoc retrieval algorithm, that is, how much of the range of available relevant information is covered by the search results. Information coverage is a central aspect for retrieval,…

Information Retrieval · Computer Science 2026-03-23 Saron Samuel , Andrew Yates , Dawn Lawrie , Ian Soboroff , Trevor Adriaanse , Benjamin Van Durme , Eugene Yang

Short-read DNA sequencing instruments can yield over 1e+12 bases per run, typically composed of reads 150 bases long. Despite this high throughput, de novo assembly algorithms have difficulty reconstructing contiguous genome sequences using…

Genomics · Quantitative Biology 2023-06-09 Eric Chen , Justin Chu , Jessica Zhang , Rene L. Warren , Inanc Birol

A common approach for designing scalable algorithms for massive data sets is to distribute the computation across, say $k$, machines and process the data using limited communication between them. A particularly appealing framework here is…

Data Structures and Algorithms · Computer Science 2017-05-24 Sepehr Assadi , Sanjeev Khanna

Reconstructing weighted networks from partial information is necessary in many important circumstances, e.g. for a correct estimation of systemic risk. It has been shown that, in order to achieve an accurate reconstruction, it is crucial to…

Physics and Society · Physics 2017-03-07 Tiziano Squartini , Giulio Cimini , Andrea Gabrielli , Diego Garlaschelli

Motivation: Second generation sequencing technology makes it feasible for many researches to obtain enough sequence reads to attempt the de novo assembly of higher eukaryotes (including mammals). De novo assembly not only provides a tool…

Genomics · Quantitative Biology 2010-08-17 Thomas C Conway , Andrew J Bromage

This paper revisits two classical distributed problems in anonymous networks, namely spanning tree construction and topology recognition, from the point of view of graph covering theory. For both problems, we characterize necessary and…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-26 Arnaud Casteigts , Yves Métivier , John Michael Robson

Massively parallel sequencing techniques have revolutionized biological and medical sciences by providing unprecedented insight into the genomes of humans, animals, and microbes. Modern sequencing platforms generate enormous amounts of…

DNA emerges as a promising medium for the exponential growth of digital data due to its density and durability. This study extends recent research by addressing the \emph{coverage depth problem} in practical scenarios, exploring optimal…

Information Theory · Computer Science 2024-02-01 Hadas Abraham , Rayn Gabrys , Eitan Yaakobi

Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related species. They devised an $O(n \log g)$…

Data Structures and Algorithms · Computer Science 2016-02-11 Timo Beller , Enno Ohlebusch

Computing haplotypes from sequencing data, i.e. haplotype assembly, is an important component of molecular and population genetics problems, including interpreting the effects of genetic variation on complex traits and reconstructing…

Genomics · Quantitative Biology 2026-03-12 Marjan Hosseini , Ella Veiner , Thomas Bergendahl , Tala Yasenpoor , Zane Smith , Margaret Staton , Derek Aguiar

In the human genomes, recombination frequency between homologous chromosomes during meiosis is highly correlated with their physical length while it differs significantly when their coding density is considered. Furthermore, it has been…

Populations and Evolution · Quantitative Biology 2010-02-01 Dorota Mackiewicz , Marta Zawierta , Wojciech Waga , Stanislaw Cebrat

Background: We study the statistical properties of fragment coverage in genome sequencing experiments. In an extension of the classic Lander-Waterman model, we consider the effect of the length distribution of fragments. We also introduce…

Genomics · Quantitative Biology 2010-05-03 Steven N. Evans , Valerie Hower , Lior Pachter

Genome-centric analysis of metagenomic samples is a powerful method for understanding the function of microbial communities. Calculating read coverage is a central part of analysis, enabling differential coverage binning for recovery of…

Natural genomes sometimes encode two different proteins in staggered reading frames of the same DNA sequence. Despite the prevalence of these 'overlapping genes' across the tree of life, it remains unknown whether arbitrary protein pairs…

Biomolecules · Quantitative Biology 2026-04-02 Orson Kirsch , Nicole Wood , Steven A Redford , Kabir Husain

Branched molecules of deoxyribonucleic acid (DNA) can self-assemble into nanostructures through complementary cohesive strand base pairing. The production of DNA nanostructures is valuable in targeted drug delivery and biomolecular…

Combinatorics · Mathematics 2022-03-15 D. Chloe Griffin , Jessica Sorrells
‹ Prev 1 3 4 5 6 7 10 Next ›