Abstract
We study the following fault tolerant variant of the interval group testing model: Given four positive integers n, p, s, e, determine the minimum number of questions needed to identify a (possibly empty) set P ⊆ {1,2,..., n} (|P| ≤ p), under the following constraints. Questions have the form “Is I ∩ P ≠ ∅?”, where I can be any interval in {1,2..., n}. Questions are to be organized in s batches of non-adaptive questions (stages), i.e, questions in a given batch can be formulated relying only on the information gathered with the answers to the questions in the previous batches. Up to e of the answers can be erroneous or lies.
The study of interval group testing is motivated by several applications. remarkably, to the problem of identifying splice sites in a genome. In particular, such application motivates to focus algorithms that are fault tolerant to some degree and organize the questions in few stages, i.e., on the cases when s is small, typically not larger than 2. To the best of our knowledge, we are the first to consider fault tolerant strategies for interval group testing.
We completely characterize the fully non-adaptive situation and provide tight bounds for the case of two batch strategies. Our bounds only differ by a factor of \(\sqrt{11/10}\) for the case p = 1 and at most 2 in the general case.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cicalese, F., Damaschke, P., Vaccaro, U.: Optimal group testing strategies with interval queries and their application to splice site detection. Int. Journal of Bioinformatics Research and Applications
Cicalese, F., Damaschke, P., Tansini, L., Werth, S.: Overlaps Help: Improved Bounds for Group Testing with Interval Queries. Discrete Applied Mathematics (to appear)
Cormode, G., Muthukrishnan, S.: What’s hot and what’s not: Tracking most frequent items dynamically. In: ACM Principles of Database Systems (2003)
Cox, L.A., Sun, X., Qiu, Y.: Optimal and Heuristic Search for a Hidden Object in one Dimension. In: Proc. of IEEE Conf. on System, Man, and Cybernetics, pp. 1252–1256 (1994)
Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and its Applications. World Scientific, Singapore (2000)
Farach, M., Kannan, S., Knill, E.H., Muthukrishnan, S.: Group testing with sequences in experimental molecular biology. In: Carpentieri, B., De Santis, A., Vaccaro, U., Storer, J. (eds.) Proc. of Compression and Complexity of Sequences 1997, pp. 357–367. IEEE CS Press, Los Alamitos (1997)
Knill, E.: Lower Bounds for Identifying Subset Members with Subset Queries. In: Proceedings of Symposium on Discrete Algorithms 1995 (SODA 1995), pp. 369–377 (1995)
Gelfand, M., Mironov, A., Pevzner, P.A., Roytberg, M., Sze, S.H.: PROCRUSTES: Similarity-based gene recognition via spliced alignment, http://www-hto.usc.edu/software/procrustes/
Hong, E.H., Ladner, R.E.: Group testing for image compression. IEEE Transactions on Image Processing 11(8), 901–911 (2002)
Hong, Y.W., Scaglione, A.: On multiple access for distributed dependent sources: A content-based group testing approach. In: IEEE Information Theory Workshop ITW (2004)
Hong, Y.W., Scaglione, A.: Group testing for sensor networks: the value of asking the right answers. In: Asilomar Conference (2004)
Hong, Y.W., Scaglione, A.: Generalized group testing for retrieving distributed information. In: ICASSP (2005)
Karp, R.: ISIT 1998 Plenary Lecture Report: Variations on the theme of Twenty Questions. IEEE Information Theory Society Newsletter 49(1) (1999)
Ngo, H.Q., Du, D.Z.: A survey on combinatorial group testing algorithms with applications to DNA library screening. Discrete Mathematical Problems with Medical Applications. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Amer. Math. Soc. 55, 171–182 (2000)
Pevzner, P.A.: Computational Molecular Biology, An Algorithmic Approach. MIT Press, Cambridge (2000)
Sobel, M., Groll, P.A.: Group testing to eliminate efficiently all defectives in a binomial sample. The Bell Systems Technical Journal 38, 1179–1253 (1959)
Wolf, J.: Born again group testing: Multiaccess communications. IEEE Trans. Information Theory IT-31, 185–191 (1985)
Xu, G., Sze, S.H., Liu, C.P., Pevzner, P.A., Arnheim, N.: Gene hunting without sequencing genomic clones: Finding exon boundaries in cDNAs. Genomics 47, 171–179 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cicalese, F., Amgarten Quitzau, J.A. (2007). 2-Stage Fault Tolerant Interval Group Testing. In: Tokuyama, T. (eds) Algorithms and Computation. ISAAC 2007. Lecture Notes in Computer Science, vol 4835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77120-3_74
Download citation
DOI: https://doi.org/10.1007/978-3-540-77120-3_74
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77118-0
Online ISBN: 978-3-540-77120-3
eBook Packages: Computer ScienceComputer Science (R0)