### Skapa referens, olika format (klipp och klistra)

**Harvard**

Damaschke, P., Cicalese, F. och Vaccaro, U. (2005) *Optimal group testing algorithms with interval queries and their application to splice site detection*.

** BibTeX **

@article{

Damaschke2005,

author={Damaschke, Peter and Cicalese, Ferdinando and Vaccaro, Ugo},

title={Optimal group testing algorithms with interval queries and their application to splice site detection},

journal={International Journal of Bioinformatics Research and Applications},

issn={1744-5485},

volume={1},

issue={4},

pages={363-388},

abstract={We consider the following constrained version of the classical Group Testing problem: Given a finite set of
items identified with the set of natural numbers from 1 to
n, and an unknown distinguished subset P of up to p
positive elements, the goal is to 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 cardinality at most d. This particular case of the Group Testing problem naturally arises in computational biology in the context of
searching for splice sites within a gene. In this paper we focus on algorithms that solve the aforesaid problem and
for which queries can be arranged in stages: in each stage
a certain number of queries can be performed in parallel, while queries of a given stage can be chosen depending on the answers to those of previous stages. Algorithms that operate in few stages are usually preferred in practical applications. We study the case with one positive element
comprehensively. We obtain asymptotically tight bounds on the number of queries of two-stage strategies for arbitrarily many positives. Finally, we extend our results to strategies with any number of stages and positives.},

year={2005},

keywords={splice sites, combinatorial group testing, gene prediction},

}

** RefWorks **

RT Journal Article

SR Print

ID 11137

A1 Damaschke, Peter

A1 Cicalese, Ferdinando

A1 Vaccaro, Ugo

T1 Optimal group testing algorithms with interval queries and their application to splice site detection

YR 2005

JF International Journal of Bioinformatics Research and Applications

SN 1744-5485

VO 1

IS 4

SP 363

OP 388

AB We consider the following constrained version of the classical Group Testing problem: Given a finite set of
items identified with the set of natural numbers from 1 to
n, and an unknown distinguished subset P of up to p
positive elements, the goal is to 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 cardinality at most d. This particular case of the Group Testing problem naturally arises in computational biology in the context of
searching for splice sites within a gene. In this paper we focus on algorithms that solve the aforesaid problem and
for which queries can be arranged in stages: in each stage
a certain number of queries can be performed in parallel, while queries of a given stage can be chosen depending on the answers to those of previous stages. Algorithms that operate in few stages are usually preferred in practical applications. We study the case with one positive element
comprehensively. We obtain asymptotically tight bounds on the number of queries of two-stage strategies for arbitrarily many positives. Finally, we extend our results to strategies with any number of stages and positives.

LA eng

OL 30