John Cozzens CCF Division of Computing and Communication Foundations
CSE Direct For Computer & Info Scie & Enginr
October 1, 2012
September 30, 2015 (Estimated)
Awarded Amount to Date:
Alexander Barg email@example.com (Principal Investigator)
University of Maryland College Park
3112 LEE BLDG 7809 Regents Drive
COLLEGE PARK, MD
COMM & INFORMATION FOUNDATIONS
Program Reference Code(s):
Program Element Code(s):
Next generation high-throughput sequencing devices have brought the promise of personalized genotyping to the field of human genomics. Advances in personalized genotyping depend on developments of procedures for cost-efficient large-scale association studies. Such large-scale experiments and studies face a number of obstacles related to constraints imposed by bioengineering systems and test subjects, including a) the restriction that tests have to be performed with small samples of individuals' genetic material; b) the constraint that subjects have to be multiplexed, so that genetic sequences have to be barcoded; c) the fact that the outcomes of the tests are semi-quantitative; d) the reality that many tests have to be performed within groups of related individuals, thereby significantly increasing the cost of screening whole families; e) the fact that tests have to deal with the challenge of variant discovery and individuals that may exhibit different gene copy numbers. A natural way to overcome these and many other obstacles is to perform genotyping via group testing.
The goals of this project include developing of a comprehensive, yet analytically or computationally tractable general theory of group testing for genotyping. The proposed theory will answer the unique challenges arising in genotyping by sequencing, although parts of the theory may find independent applications in areas as diverse as constrained multiple access channel analysis, fingerprinting and identification coding, and error-control coding. In particular, the investigators introduce several new models into the field of group testing, including subjects with different types and strengths, semi-quantitative testing, two-dimensional pooling, and Poisson probabilistic testing.
PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
A. Barg and M. Skriganov. "Association schemes on general measure spaces and zero-dimensional Abelian groups," Advances in Mathematics, v.281, 2015, p. 142.
A. Barg and W. Park. "On linear ordered codes," Moscow Mathematical Journal, v.15, 2015.
A. Barg and W.-H. Yu. "New bounds for spherical two-distance sets," Experimental Mathematics, v.22, 2013, p. 187.
A. Barg, A. Mazumdar, And R. Wang. "Restricted isometry property of random subdictionaries," IEEE Transactions on Information Theory, v.61, 2015, p. 4440.