Optimal group testing algorithms with interval queries and their application to splice site detection
{{output}}
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 ... ...
