English
Related papers

Related papers: Do Read Errors Matter for Genome Assembly?

200 papers

Sequence comparison is a prerequisite to virtually all comparative genomic analyses. It is often realized by sequence alignment techniques, which are computationally expensive. This has led to increased research into alignment-free…

Data Structures and Algorithms · Computer Science 2015-12-23 Maxime Crochemore , Gabriele Fici , Robert Mercaş , Solon P. Pissis

DNA sequencing is revolutionising the field of medicine. DNA sequencers, the machines which perform DNA sequencing, have evolved from the size of a fridge to that of a mobile phone over the last two decades. The cost of sequencing a human…

Genomics · Quantitative Biology 2021-01-14 Hasindu Gamaarachchi

In this paper, we propose a novel iterative encoding algorithm for DNA storage to satisfy both the GC balance and run-length constraints using a greedy algorithm. DNA strands with run-length more than three and the GC balance ratio far from…

Information Theory · Computer Science 2023-01-04 Seong-Joon Park , Yongwoo Lee , Jong-Seon No

DNA storage is now being considered as a new archival storage method for its durability and high information density, but still facing some challenges like high costs and low throughput. By reducing sequencing sample size for decoding…

Information Theory · Computer Science 2025-04-22 Ruiying Cao , Xin Chen

We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries about the object, even if the data structure has been…

Data Structures and Algorithms · Computer Science 2008-12-01 Ronald de Wolf

The high-throughput short-reads RNA-seq protocols often produce paired-end reads, with the middle portion of the fragments being unsequenced. We explore if the full-length fragments can be computationally reconstructed from the sequenced…

Genomics · Quantitative Biology 2023-10-06 Xiang Li , Mingfu Shao

DNA codes have garnered significant interest due to their utilization in digital media storage, cryptography, and DNA computing. In this paper, we first extend the results of constructing reversible group codes \cite{Cengellenmis} and…

Information Theory · Computer Science 2024-09-11 Guodong Wang , Hongwei Liu , Xueyan Chen

Motivation: With the development of third-generation sequencing technologies, people are able to obtain DNA sequences with lengths from 10s to 100s of kb. These long reads allow protein domain annotation without assembly, thus can produce…

Genomics · Quantitative Biology 2021-07-09 Du Nan , Jiayu Shang , Yanni Sun

Next-generation sequencing technologies provide a revolutionary tool for generating gene expression data. Starting with a fixed RNA sample, they construct a library of millions of differentially abundant short sequence tags or "reads",…

Quantitative Methods · Quantitative Biology 2014-05-13 Dimitrios V. Vavoulis , Julian Gough

Gene set analysis, a popular approach for analyzing high-throughput gene expression data, aims to identify sets of related genes that show significantly enriched or depleted expression patterns between different conditions. In the last…

In this paper, we propose a semi-supervised deep learning method for detecting the specific types of reads that impede the de novo genome assembly process. Instead of dealing directly with sequenced reads, we analyze their coverage graphs…

Machine Learning · Computer Science 2019-04-24 Tomislav Šebrek , Jan Tomljanović , Josip Krapac , Mile Šikić

Generative adversarial networks (GANs) generate data based on minimizing a divergence between two distributions. The choice of that divergence is therefore critical. We argue that the divergence must take into account the hypothesis set and…

Machine Learning · Computer Science 2019-11-07 Ben Adlam , Corinna Cortes , Mehryar Mohri , Ningshan Zhang

Background - The process of generating raw genome sequence data continues to become cheaper, faster, and more accurate. However, assembly of such data into high-quality, finished genome sequences remains challenging. Many genome assembly…

Genomics · Quantitative Biology 2015-02-02 Keith R. Bradnam , Joseph N. Fass , Anton Alexandrov , Paul Baranay , Michael Bechner , İnanç Birol , Sébastien Boisvert , Jarrod A. Chapman , Guillaume Chapuis , Rayan Chikhi , Hamidreza Chitsaz , Wen-Chi Chou , Jacques Corbeil , Cristian Del Fabbro , T. Roderick Docking , Richard Durbin , Dent Earl , Scott Emrich , Pavel Fedotov , Nuno A. Fonseca , Ganeshkumar Ganapathy , Richard A. Gibbs , Sante Gnerre , Élénie Godzaridis , Steve Goldstein , Matthias Haimel , Giles Hall , David Haussler , Joseph B. Hiatt , Isaac Y. Ho , Jason Howard , Martin Hunt , Shaun D. Jackman , David B Jaffe , Erich Jarvis , Huaiyang Jiang , Sergey Kazakov , Paul J. Kersey , Jacob O. Kitzman , James R. Knight , Sergey Koren , Tak-Wah Lam , Dominique Lavenier , François Laviolette , Yingrui Li , Zhenyu Li , Binghang Liu , Yue Liu , Ruibang Luo , Iain MacCallum , Matthew D MacManes , Nicolas Maillet , Sergey Melnikov , Bruno Miguel Vieira , Delphine Naquin , Zemin Ning , Thomas D. Otto , Benedict Paten , Octávio S. Paulo , Adam M. Phillippy , Francisco Pina-Martins , Michael Place , Dariusz Przybylski , Xiang Qin , Carson Qu , Filipe J Ribeiro , Stephen Richards , Daniel S. Rokhsar , J. Graham Ruby , Simone Scalabrin , Michael C. Schatz , David C. Schwartz , Alexey Sergushichev , Ted Sharpe , Timothy I. Shaw , Jay Shendure , Yujian Shi , Jared T. Simpson , Henry Song , Fedor Tsarev , Francesco Vezzi , Riccardo Vicedomini , Jun Wang , Kim C. Worley , Shuangye Yin , Siu-Ming Yiu , Jianying Yuan , Guojie Zhang , Hao Zhang , Shiguo Zhou , Ian F. Korf

We study permutations over the set of $\ell$-grams, that are feasible in the sense that there is a sequence whose $\ell$-gram frequency has the same ranking as the permutation. Codes, which are sets of feasible permutations, protect…

Information Theory · Computer Science 2021-01-18 Niv Beeri , Moshe Schwartz

A critical step of genome sequence analysis is the mapping of sequenced DNA fragments (i.e., reads) collected from an individual to a known linear reference genome sequence (i.e., sequence-to-sequence mapping). Recent works replace the…

DNA has many valuable characteristics that make it suitable for a long-term storage medium, in particular its durability and high information density. DNA can be stored safely for hundreds of years with virtually no degradation, in contrast…

Quantitative Methods · Quantitative Biology 2022-05-31 Jamie J. Alnasir , Thomas Heinis , Louis Carteron

Intercellular heterogeneity serves as both a confounding factor in studying individual clones and an information source in characterizing any heterogeneous tissues, such as blood, tumor systems. Due to inevitable sequencing errors and other…

Genomics · Quantitative Biology 2014-09-30 Guoqiang Yu , Roger R. Wang , Sean S. Wang , Niya Wang , Yue Wang

The Generative Adversarial Network (GAN) has achieved great success in generating realistic (real-valued) synthetic data. However, convergence issues and difficulties dealing with discrete data hinder the applicability of GAN to text. We…

Machine Learning · Statistics 2017-11-21 Yizhe Zhang , Zhe Gan , Kai Fan , Zhi Chen , Ricardo Henao , Dinghan Shen , Lawrence Carin

In [1], the authors proposed a new model of DNA storage system that integrates all three steps of retrieval and introduced the concept of DNA-correcting codes, which guarantees that the output of the storage system can be decoded to the…

Information Theory · Computer Science 2023-11-17 Huawei Wu

Genome-to-genome comparisons require designating anchor points, which are given by Maximum Exact Matches (MEMs) between their sequences. For large genomes this is a challenging problem and the performance of existing solutions, even in…

Data Structures and Algorithms · Computer Science 2018-05-24 Szymon Grabowski , Wojciech Bieniecki