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

**Harvard**

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

** BibTeX **

@conference{

Cicalese2005,

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

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

booktitle={International Workshop on Bioinformatics Research and Applications IWBRA 2005 (part of ICCS 2005), Lecture Notes in Computer Science},

pages={1029-1037},

abstract={The classical Group Testing Problem is: Given a finite set of items {1,2,..., n} and an unknown subset P of up to p
positive elements, identify P by asking the least number
of queries of the type ``does the subset Q intersect P?".
In our case, Q must be a subset of consecutive elements.
This problem naturally arises in several scenarios, most notably in Computational Biology. We focus on algorithms
in which queries are arranged in stages: in each stage, queries can be performed in parallel, and be chosen depending on the answers to queries in previous stages. Algorithms that operate in few stages are usually preferred
in practice. First we study the case p=1 comprehensively.
For two-stage strategies for arbitrary p we obtain
asymptotically tight bounds on the number of queries. Furthermore we prove bounds for any number of stages and positives, and we discuss the problem with the restriction that query intervals have some bounded length d.},

year={2005},

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

}

** RefWorks **

RT Conference Proceedings

SR Print

ID 5101

A1 Cicalese, Ferdinando

A1 Damaschke, Peter

A1 Vaccaro, Ugo

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

YR 2005

T2 International Workshop on Bioinformatics Research and Applications IWBRA 2005 (part of ICCS 2005), Lecture Notes in Computer Science

SP 1029

OP 1037

AB The classical Group Testing Problem is: Given a finite set of items {1,2,..., n} and an unknown subset P of up to p
positive elements, identify P by asking the least number
of queries of the type ``does the subset Q intersect P?".
In our case, Q must be a subset of consecutive elements.
This problem naturally arises in several scenarios, most notably in Computational Biology. We focus on algorithms
in which queries are arranged in stages: in each stage, queries can be performed in parallel, and be chosen depending on the answers to queries in previous stages. Algorithms that operate in few stages are usually preferred
in practice. First we study the case p=1 comprehensively.
For two-stage strategies for arbitrary p we obtain
asymptotically tight bounds on the number of queries. Furthermore we prove bounds for any number of stages and positives, and we discuss the problem with the restriction that query intervals have some bounded length d.

LA eng

OL 30