[{"department":[{"_id":"441317"},{"_id":"66100"}],"abstract":[{"lang":"eng","text":"Given a finite ordered set of items and an unknown distinguished subset P of up to p positive elements, identify the items in P by asking the least number of queries of the type \"does the subset Q intersect P?\", where Q is a subset of consecutive elements of {1, 2,..., n}. This problem arises e.g. in computational biology, in a particular method for determining splice sites. We consider time-efficient algorithms where queries are arranged in a fixed number s of stages: in each stage, queries are performed in parallel. In a recent paper we devised query-optimal strategies in the special cases p = 1 or s = 2, subject to lower-order terms. Exploiting new ideas we are now able to provide a much neater argument that allows doubling the general lower bound for any p ! 2 and s >= 3. Moreover, we provide new strategies that match this new bound up to the constant of the main term. The new query scheme shows an effective use of overlapping queries within a stage. Remarkably, this contrasts with the known results for s <= 2 where optimal strategies were implemented by disjoint queries."}],"year":"2005","date_updated":"2018-07-24T12:59:56Z","accept":"1","date_submitted":"2012-06-01T13:05:09Z","publication_identifier":{"issn":["0302-9743"]},"first_author":"Cicalese, Ferdinando","id":"2308867","language":[{"iso":"eng"}],"page":"935-944","_id":"2308867","publication_status":"published","date_created":"2011-08-05T09:03:18Z","conference":{"name":"11th Annual International Conference on Computing and Combinatorics (COCOON 2005)"},"status":"public","author":[{"first_name":"Ferdinando","full_name":"Cicalese, Ferdinando","luAuthorMark":"1","autoren_ansetzung":["Cicalese, Ferdinando","Cicalese","Ferdinando Cicalese","Cicalese, F","Cicalese, F.","F Cicalese","F. Cicalese"],"last_name":"Cicalese"},{"first_name":"Peter","full_name":"Damaschke, Peter","autoren_ansetzung":["Damaschke, Peter","Damaschke","Peter Damaschke","Damaschke, P","Damaschke, P.","P Damaschke","P. Damaschke"],"last_name":"Damaschke"},{"last_name":"Tansini","autoren_ansetzung":["Tansini, Libertad","Tansini","Libertad Tansini","Tansini, L","Tansini, L.","L Tansini","L. Tansini"],"full_name":"Tansini, Libertad","first_name":"Libertad"},{"autoren_ansetzung":["Werth, Soeren","Werth","Soeren Werth","Werth, S","Werth, S.","S Werth","S. Werth"],"last_name":"Werth","first_name":"Soeren","full_name":"Werth, Soeren"}],"series_title":"Lecture Notes in Computer Science, 3595","doi":"10.1007/11533719_94","citation":{"ieee":" F. Cicalese, et al., “Overlaps Help: Improved Bounds for Group Testing with Interval Queries”, *Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005)*, Lecture Notes in Computer Science, 3595, 2005, pp.935-944.","lncs":" Cicalese, F., Damaschke, P., Tansini, L., Werth, S.: Overlaps Help: Improved Bounds for Group Testing with Interval Queries. Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005). Lecture Notes in Computer Science, 3595. p. 935-944. (2005).","harvard1":"Cicalese, F., et al., 2005. Overlaps Help: Improved Bounds for Group Testing with Interval Queries. In *Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005)*. Lecture Notes in Computer Science, 3595. pp. 935-944.","apa_indent":"Cicalese, F., Damaschke, P., Tansini, L., & Werth, S. (2005). Overlaps Help: Improved Bounds for Group Testing with Interval Queries. *Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005)*, 935-944. doi:10.1007/11533719_94

","angewandte-chemie":"F. Cicalese, P. Damaschke, L. Tansini, and S. Werth, in *Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005)*, **2005**, p. 935-944.","chicago":"Cicalese, Ferdinando, Damaschke, Peter, Tansini, Libertad, and Werth, Soeren. 2005. “Overlaps Help: Improved Bounds for Group Testing with Interval Queries”. In *Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005)*, 935-944. Lecture Notes in Computer Science, 3595.

","aps":" F. Cicalese, et al., Overlaps Help: Improved Bounds for Group Testing with Interval Queries, in *Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005)*, Lecture Notes in Computer Science, 3595 (2005), p. 935-944.","default":"Cicalese F, Damaschke P, Tansini L, Werth S (2005)

In: Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005). Lecture Notes in Computer Science, 3595. 935-944.","bio1":"Cicalese F, Damaschke P, Tansini L, Werth S (2005)

Overlaps Help: Improved Bounds for Group Testing with Interval Queries.

In: Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005). Lecture Notes in Computer Science, 3595, 935-944.","mla":"Cicalese, Ferdinando, Damaschke, Peter, Tansini, Libertad, and Werth, Soeren. “Overlaps Help: Improved Bounds for Group Testing with Interval Queries”. *Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005)*. 2005. Lecture Notes in Computer Science, 3595. 935-944.","dgps":"Cicalese, F., Damaschke, P., Tansini, L. & Werth, S. (2005). Overlaps Help: Improved Bounds for Group Testing with Interval Queries (Lecture Notes in Computer Science, 3595). *Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005)* (S. 935-944). Gehalten auf der 11th Annual International Conference on Computing and Combinatorics (COCOON 2005). doi:10.1007/11533719_94.

","ama":"Cicalese F, Damaschke P, Tansini L, Werth S. Overlaps Help: Improved Bounds for Group Testing with Interval Queries. In: *Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005)*. Lecture Notes in Computer Science, 3595. 2005: 935-944.","wels":"Cicalese, F.; Damaschke, P.; Tansini, L.; Werth, S. (2005): Overlaps Help: Improved Bounds for Group Testing with Interval Queries. In: Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005). (Lecture Notes in Computer Science, 3595, ). S. 935-944.","frontiers":"Cicalese, F., Damaschke, P., Tansini, L., and Werth, S. (2005). “Overlaps Help: Improved Bounds for Group Testing with Interval Queries” in *Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005)* Lecture Notes in Computer Science, 3595 935-944.","apa":"Cicalese, F., Damaschke, P., Tansini, L., & Werth, S. (2005). Overlaps Help: Improved Bounds for Group Testing with Interval Queries. *Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005)*, 935-944. doi:10.1007/11533719_94"},"title":"Overlaps Help: Improved Bounds for Group Testing with Interval Queries","publication":"Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005)","type":"conference"}]