Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection

Given an ordered set of n items and an unknown subset P of up to p positive elements, we want to identify P by asking the least number of queries ‘does Q intersect P?’ where Q must consist of consecutive elements. This Interval Group Testing problem arises in the context of splice site detection in genes. We study algorithms that operate in a few stages where queries chosen depending on previous answers, are performed in parallel. We obtain tight bounds for two-stage strategies. Finally, we get results for any number of stages and positives

Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection

The classical Group Testing Problem is: Given a finite set of items {1,2,..., n} and an unknown subset P of up to ppositive elements, identify P by asking the least number of queries of the type ``does the subset Q intersect P?". In our case, Q must be a subset of consecutive elements. This problem naturally arises in several scenarios, most notably in Computational Biology. We focus on algorithms in which queries are arranged in stages: in each stage, queries can be performed in parallel, and be chosen depending on the answers to queries in previous stages. Algorithms that operate in few stages are usually preferredin practice. First we study the case p=1 comprehensively.For two-stage strategies for arbitrary p we obtainasymptotically tight bounds on the number of queries. Furthermore we prove bounds for any number of stages and positives, and we discuss the problem with the restriction that query intervals have some bounded length d

Optimal group testing strategies with interval queries and their application to splice site detection

Cicalese F, Damaschke P, Vaccaro U. Optimal group testing strategies with interval queries and their application to splice site detection. In: Sunderam VS, van Albada GD, Sloot PMA, Dongarra JJ, eds. Computational Science – ICCS 2005. 5th International Conference, Atlanta, GA, USA, May 22-25, 2005. Proceedings, Part II. Lecture Notes in Computer Science. Vol 3515. Berlin: Springer; 2005: 1029-1037.The classical Group Testing Problem is: Given a finite set of items {1, 2,..., n} and an unknown subset P subset of {1, 2,..., n} of up to p positive elements, identify P by asking the least number of queries of the type "does the subset Q subset of {1,2,...,n} intersect P?". In our case, Q must be a subset of consecutive elements. This problem naturally arises in several scenarios, most notably in Computational Biology. We focus on algorithms in which queries are arranged in stages: in each stage, queries can be performed in parallel, and be chosen depending on the answers to queries in previous stages. Algorithms that operate in few stages are usually preferred in practice. First we study the case p = 1 comprehensively. For two-stage strategies for arbitrary p we obtain asymptotically tight bounds on the number of queries. Furthermore we prove bounds for any number of stages and positives, and we discuss the problem with the restriction that query intervals have some bounded length d