Compressed Genotyping

DOI10.1109/TIT.2009.2037043MaRDI QIDQ4976005zbMATH OpenDBLPWikidataFDO

Authors Yaniv Erlich, Assaf Gordon, Michael Brand, Gregory J. Hannon, P. P. Mitra

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0909.3691

Mathematics Subject Classification ID

Genetics and epigenetics (92D10)

Abstract: Significant volumes of knowledge have been accumulated in recent years linking subtle genetic variations to a wide variety of medical disorders from Cystic Fibrosis to mental retardation. Nevertheless, there are still great challenges in applying this knowledge routinely in the clinic, largely due to the relatively tedious and expensive process of DNA sequencing. Since the genetic polymorphisms that underlie these disorders are relatively rare in the human population, the presence or absence of a disease-linked polymorphism can be thought of as a sparse signal. Using methods and ideas from compressed sensing and group testing, we have developed a cost-effective genotyping protocol. In particular, we have adapted our scheme to a recently developed class of high throughput DNA sequencing technologies, and assembled a mathematical framework that has some important distinctions from 'traditional' compressed sensing ideas in order to address different biological and technical constraints.

Cited in

(6)

• Compression of Whole Genome Alignments
• Bayesian clustering of DNA sequences using Markov chains and a stochastic partition model
• Data Rotation Improves Genomotyping Efficiency
• Superimposed codes and threshold group testing
• De Novo NGS Data Compression
• Search for sparse active inputs: a review

This page was built for publication: Compressed Genotyping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976005)