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.
Titolo: | Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection |
Autori: | |
Data di pubblicazione: | 2005 |
Rivista: | |
Abstract: | 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. |
Handle: | http://hdl.handle.net/11386/1000482 |
Appare nelle tipologie: | 1.1.2 Articolo su rivista con ISSN |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.