Optimal Group Testing strategies with interval queries and their application to splice site detection

Lecture Notes in Computer Science

Volumn 3515, Issue II, 2005, Pages 1029-1037

  Cicalese, Ferdinande ^a   Damaschke, Peter ^b   Vaccaro, Ugo ^c  

^a BIELEFELD UNIVERSITY   (Germany)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^c UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SET THEORY; COMPUTER SCIENCE; COMPUTERS;

COMPUTATIONAL BIOLOGY; OPTIMAL GROUP TESTING STRATEGIES; FINITE SET; GROUP TESTING; SPLICE SITE; TIGHT BOUND; TWO-STAGE;

PROBLEM SOLVING; ARTIFICIAL INTELLIGENCE;

EID: 25144466003     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11428848_130     Document Type: Conference Paper

References (13)

1. F. Cicalese, P. Damaschke, U. Vaccaro, Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection, Technical Report 2004-04, Universität Bielefeld, Technische Fakultät. Available at http://www.cs.chalmers.se/~ptr/2004-04.pdf.
2. G. Cormode, S. Muthukrishnan, What's hot and what's not: Tracking most frequent items dynamically, in: ACM Principles of Database Systems, 2003.
3. L. A. Cox, X. Sun, and Y. Qiu, 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.
4. A. De Bonis, L. Gasieniec, U. Vaccaro, Generalized Framework for Selectors with Applications in Optimal Group Testing, in: ICALP '03, LNCS 2719, pp. 81-96, Springer-Verlag, 2003.
5. D.Z. Du and F.K. Hwang, Combinatorial Group Testing and its Applications, World Scientific, Singapore, 2000.
6. M. Farach, S. Kannan, E.H. Knill, S. Muthukrishnan, Group Testing with Sequences in Experimental Molecular Biology, in: Proc. of Compression and Complexity of Sequences 1997, B. Carpentieri, A. De Santis, U. Vaccaro, J. Storer (Eds.), IEEE CS Press, pp. 357-367, 1997.
7. E. H. Hong and R.E. Ladner, Group testing for image compression, IEEE Transactions on Image Processing, 11(8), pp. 901-911, 2002.
8. R. Karp, ISIT'98 Plenary Lecture Report: Variations on the theme of 'Twenty Questions', IEEE Information Theory Society Newsletter, vol. 49, No.l, March 1999.
9. E. Knill, Lower Bounds for Identifying Subset Members with Subset Queries, in: Proceedings of Symposium on Discrete Algorithms 1995 (SODA 1995), pp. 369-377, 1995.
10. Hung Q. Ngo and Ding-Zhu Du, A survey on combinatorial group testing algorithms with applications to DNA library screening, in: Discrete Mathematical Problems with Medical Applications, DIMACS Series Discrete Math. Theoret. Computer Science, 55, Amer. Math. Soc., pp. 171-182, 2000.
11. P.A. Pevzner, Computational Molecular Biology, An Algorithmic Approach, MIT Press, 2000.
12. J. Wolf, Born again group testing: Multiaccess communications, IEEE Trans. Information Theory, IT-31, pp. 185-191, 1985.
13. G. Xu, S.H. Sze, C.P. Liu, P.A. Pevzner, N. Arnheim, Gene hunting without sequencing genomic clones: Finding exon boundaries in cDNAs, Genomics, 47, pp. 171-179, 1998.