Pooling designs for clone library screening in the inhibitor complex model Department of Mathematics and Science National Taiwan Normal University (Lin-Kou)

Slides:



Advertisements
Similar presentations
NETCOD 2013 June 7-9, Calgary Broadcast Erasure Channel with Feedback: the Two Multicast Case Algorithms and Bounds Efe Onaran 1, Marios Gatzianas 2 and.
Advertisements

Chun-Cheng Chen Department of Mathematics National Central University 1.
February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1 Addition of Integers Example: Add a = (1110) 2 and b = (1011) 2. a 0 + b.
Applied Informatics Štefan BEREŽNÝ
國立暨南國際大學 National Chi Nan University A Study of (k, n)-threshold Secret Image Sharing Schemes in Visual Cryptography without Expansion Presenter : Ying-Yu.
A very little Game Theory Math 20 Linear Algebra and Multivariable Calculus October 13, 2004.
Simultaneous Identification of Multiple Driver Pathways in Cancer Mark D. M. Leiserson, et.al.
Balanced Graph Partitioning Konstantin Andreev Harald Räcke.
Haplotyping via Perfect Phylogeny Conceptual Framework and Efficient (almost linear-time) Solutions Dan Gusfield U.C. Davis RECOMB 02, April 2002.
August 2005RSFDGrC 2005, Regina, Canada 1 Feature Selection Based on Relative Attribute Dependency: An Experimental Study Jianchao Han 1, Ricardo Sanchez.
Quantum Computing Lecture 22 Michele Mosca. Correcting Phase Errors l Suppose the environment effects error on our quantum computer, where This is a description.
Multiple Sequence alignment Chitta Baral Arizona State University.
Achieving Minimum Coverage Breach under Bandwidth Constraints in Wireless Sensor Networks Maggie X. Cheng, Lu Ruan and Weili Wu Dept. of Comput. Sci, Missouri.
Phylogenetic Networks of SNPs with Constrained Recombination D. Gusfield, S. Eddhu, C. Langley.
MOHAMMAD IMRAN DEPARTMENT OF APPLIED SCIENCES JAHANGIRABAD EDUCATIONAL GROUP OF INSTITUTES.
Tracing a Single User Joint work with Noga Alon. Group Testing Dorfman raised the following problem in 1941: All American inductees gave blood samples,
Some Notes on the Binary GV Bound for Linear Codes Sixth International Workshop on Optimal Codes and Related Topics June , 2009, Varna, BULGARIA.
Diophantine Approximation and Basis Reduction
On comparison of different approaches to the stability radius calculation Olga Karelkina Department of Mathematics University of Turku MCDM 2011.
06/10/2015Applied Algorithmics - week81 Combinatorial Group Testing  Much of the current effort of the Human Genome Project involves the screening of.
CSC 4510 – Machine Learning Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website:
2 2.1 © 2016 Pearson Education, Inc. Matrix Algebra MATRIX OPERATIONS.
An Approximation Algorithm for Binary Searching in Trees Marco Molinaro Carnegie Mellon University joint work with Eduardo Laber (PUC-Rio)
Computational Molecular Biology Non-unique Probe Selection via Group Testing.
Lecture 10 Applications of NP-hardness. Knapsack.
Combinatorial Optimization Problems in Computational Biology Ion Mandoiu CSE Department.
Nonunique Probe Selection and Group Testing Ding-Zhu Du.
1 Closures of Relations: Transitive Closure and Partitions Sections 8.4 and 8.5.
Surya Bhupatiraju MIT PRIMES May 20 th, 2012 On the Complexity of the Marginal Consistency Problem.
Discrete Mathematics 1 Kemal Akkaya DISCRETE MATHEMATICS Lecture 16 Dr. Kemal Akkaya Department of Computer Science.
Word : Let F be a field then the expression of the form a 1, a 2, …, a n where a i  F  i is called a word of length n over the field F. We denote the.
ICS 253: Discrete Structures I Induction and Recursion King Fahd University of Petroleum & Minerals Information & Computer Science Department.
1 The 24th Clemson mini-Conference on Discrete Mathematics and Algorithms Oct. 22 – Oct. 23, 2009 Clemson University Algebraic Invariants and Some Hamiltonian.
Computer Science & Engineering, ASU1/17 Pfair Scheduling of Periodic Tasks with Allocation Constraints on Multiple Processors Deming Liu and Yann-Hang.
2 2.1 © 2012 Pearson Education, Inc. Matrix Algebra MATRIX OPERATIONS.
Computational Molecular Biology Non-unique Probe Selection via Group Testing.
1. 2  Introduction  Array Operations  Number of Elements in an array One-dimensional array Two dimensional array Multi-dimensional arrays Representation.
SECTION 2 BINARY OPERATIONS Definition: A binary operation  on a set S is a function mapping S X S into S. For each (a, b)  S X S, we will denote the.
Matrix Multiplication The Introduction. Look at the matrix sizes.
An Algorithm for the Steiner Problem in Graphs M. L. Shore, L. R. Foulds, P. B. Gibbons Networks, Vol. 12, 1982, pp Speaker: Chuang-Chieh Lin.
The geometric GMST problem with grid clustering Presented by 楊劭文, 游岳齊, 吳郁君, 林信仲, 萬高維 Department of Computer Science and Information Engineering, National.
Computational Molecular Biology
1 3/21/2016 MATH 224 – Discrete Mathematics First we determine if a graph is connected.
Learning Hidden Graphs Hung-Lin Fu 傅 恆 霖 Department of Applied Mathematics Hsin-Chu Chiao Tung Univerity.
Computational Molecular Biology Pooling Designs – Inhibitor Models.
Dr Nazir A. Zafar Advanced Algorithms Analysis and Design Advanced Algorithms Analysis and Design By Dr. Nazir Ahmad Zafar.
Group Testing and Its Applications
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
Heuristic & Approximation
Perfect Secret Sharing Schemes
Recent Interests and Progress Hung-Lin Fu (傅恒霖)
Lecture 2-6 Polynomial Time Hierarchy
The minimum cost flow problem
Mathematical Structures for Computer Science Chapter 6
Computational Molecular Biology
NP-Completeness Yin Tat Lee
Clustered representations: Clusters, covers, and partitions
2. Matrix Algebra 2.1 Matrix Operations.
Numerical Algorithms Quiz questions
Problem Solving 4.
Lecture 2-5 Applications of NP-hardness
Optimal Conflict-avoiding Codes of Odd Length Weight Three
NP-Completeness Yin Tat Lee
Pooling Designs in Group Testing
Grid-Block Designs and Packings
Computational Molecular Biology
Existence of 3-factors in Star-free Graphs with High Connectivity
Automatic Test Generation for N-way Combinatorial Testing
Optimal XOR based (2,n)-Visual Cryptography Schemes
Learning a hidden graph with adaptive algorithms
Presentation transcript:

Pooling designs for clone library screening in the inhibitor complex model Department of Mathematics and Science National Taiwan Normal University (Lin-Kou) Speaker: Fei-Huang Chang This work joins with Huilan Chang, Frank K. Hwang.

2 Outline Introduction Main tools : d-disjunct, (H:d)-disjunct matrix The classical model The complex model Conclusions

3 Introduction In the clone library screening problem, the goal is to identify a small set of positive clones from a large set of negative clones. Group test is a test on a subset of clones Negative outcome: if all clones are negative Positive outcome: if exists at least one positive clone

4 Introduction Pooling design : a sequence of group tests A nonadaptive pooling design :all tests simultaneously A pooling design is usually represented by a binary matrix M where rows are indexed by tests and columns by clones.

5 A part of a pooling design Test 1 Test 2 Test 3 clone 1 outcome positive negative The clone 4 must be a positive clone clone 2 clone 3 clone 4 clone 5clone 6clone 7

6 d-disjunct Matrix A binary matrix is called d-disjunct if no column is covered by the union of any other d columns. Theorem (Du and Hwang 2000) A d-disjunct matrix can identify all p positive clones. (p<=d). Proof: For any negative clone c, there exists a row (test) which contains c but none of all d positive clones. i.e. the outcome of the test is negative.

7 1-inhibitor model A third type of clones called inhibitors whose existence may cancel the effect of positive clones. 1-inhibitor model :(proposed by Farach et al 1997) a single inhibitor clone dictates the test outcome to be negative regardless of how many positive clones.

8 Test 1 Test 2 Test 3 clone 1 negative clone 2 clone 3 clone 4 clone 5clone 6clone 7 Inhibitor clone Negative clones Positive clones Theorem: (Hwang, Chang 2007) A (d+s)-disjunct matrix can identify all p positive clones with at most s inhibitors.

9 The general inhibitor model k-inhibitor model : k inhibitor clones dictate the test outcome to be negative. (k,g)-inhibitor model : k inhibitor clones cancel the effect of g positive clones. The general inhibitor model : we don’t know the two parameters k and g for sure. 1-inhibitor modelk-inhibitor model (k,g)-inhibitor model the general inhibitor model

10 The complex model In some DNA screening environment, it takes a subset of clones, called a complex, to induce a positive outcome. We call such a model the complex model, as versus the clone model.

11 Complex model without inhibitor Test 1 Test 2 Test 3 clone 1clone 2 clone 3 clone 4 clone 5clone 6clone 7 Complex 1={clone 1, clone 2, clone 3} may be positive Complex 2={clone 3, clone 4, clone 5} may be positive Complex 3={clone 5, clone 7} may be positive Complex 4={clone 1, clone 3, clone 4} must be negative Complex 5={clone 1, clone 2, clone 7} must be negative

12 (H:d)-disjunct matrix For a complex X, we say a row (test) covers X if it has 1-entry in every column of X. ^X: denotes the set of tests covering X. (H:d)-disjunct :

13 A general inhibitor complex model (r,d,s) Let H denote the given set of complexes in the considered problem, then H can viewed as a hypergraph with clones as vertices and complexes as edges. Denote the minimum number of rows in an (H:d)-disjunct matrix with n columns by t(H:d,n). A general inhibitor complex model (r,d,s): r: a complex has at most r clones. d: at most d positive complexes. s: at most s inhibitor complexes.

14 (Chang, Chang, Hwang 2010) Theorem 1: The number of rows in a nonadaptive pooling design for the (r,d,s) general inhibitor complex model is at least t(H:s,n). Theorem 2: An (H: d+s)-disjunct matrix can identify all positive complexes under the (r,d,s) general inhibitor complex model.

15 Conclusions We gave a nonadaptive pooling design to the most general model in such an environment with no need know the exact relation between inhibitors and positive complexes. We gave a lower bound and an upper bound of tests in a nonadaptive pooling design for some inhibitor complex model. In fact, we also gave a nonadaptive pooling design for the inhibitor complex model with error-tolerance ability and gave a more efficient pooling degign for the k-inhibitor complex model. This design is an (H:d)-disjunct matrix whose construction has been studied in Dyachkov et al. (2001), Gao et al. (2006) and Wei (2004)

16 References Chang FH, Chang H, Hwang FK (2010) Pooling designs for clone library screening in the inhibitor complex model. J Comb Optim DOI /s (online first) Chang FH, Hwang FK (2007) The identification of positive clones in a general inhibitor model. J Comput Syst Sci 73: De Bonis A, Vaccare U (1998) Improved algorithms for group testing with inhibitors. Inf Process Lett 67:57-64 De Bonis A, Vaccare U (2003) Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. Theor Comput Sci A 356: Du DZ, Hwang FK (2000) Combinational group testing and its applications, 2nd edn. World scientific, Singapore. Du DZ, Hwang FK (2005) Identifying d positive clones in the presence of inhibitors. Int J Bioinform Res Appl 1: Gao H, Hwang FK, Thai M, Wu W, Znati T (2006) Construction of d(H)-disjunct matrix for group testing in hypergraphs. J Comb Optim 12: Stinson DR, Wei R (2004) Generalized cover-free families. Discrete Math 279:

17 The End Thanks for your attention!