File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Adaptive phenotype testing for AND/OR items

TitleAdaptive phenotype testing for AND/OR items
Authors
KeywordsAdaptive phentype testing
Combinatorial group testing
Knockout study
Issue Date2011
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
The 22nd International Symposium on Algorithms and Computation (ISAAC 2011), Yokohama, Japan, 5-8 December 2011. In Lecture Notes In Computer Science, 2011, v. 7074, p. 754-763 How to Cite?
AbstractThe combinatorial group testing problem is concerned with the design of experiments so as to minimize the number of tests needed to find the sets of items responsible for a particular phenotype (an observable property). The traditional group testing problem only considers the OR problem, i.e. the phenotype appears as long as one of the responsible items exists. In this paper, we introduce the phenotype testing problem which is a generalization of the well-studied combinatorial group testing problem. In practice, there are more than one phenotype and the responsible items and their mechanism (AND or OR) for each phenotype are unknown where an AND mechanism means that the phenotype only appears if all of the responsible items exist. This phenotype testing problem has an important application in biological research, known as phenotype knockout study. New algorithms for designing adaptive experiments for solving the phenotype testing problem with n items using O(logn) tests in the worst cases are introduced. When the number of phenotypes is small, say at most 2, and the number of responsible items for each phenotype is at most 2, algorithms with near-optimal number of tests are presented. © 2011 Springer-Verlag.
DescriptionLNCS v. 7074 is conference proceedings of ISAAC 2011
Persistent Identifierhttp://hdl.handle.net/10722/152025
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorChin, FYLen_US
dc.contributor.authorLeung, HCMen_US
dc.contributor.authorYiu, SMen_US
dc.date.accessioned2012-06-26T06:32:37Z-
dc.date.available2012-06-26T06:32:37Z-
dc.date.issued2011en_US
dc.identifier.citationThe 22nd International Symposium on Algorithms and Computation (ISAAC 2011), Yokohama, Japan, 5-8 December 2011. In Lecture Notes In Computer Science, 2011, v. 7074, p. 754-763en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/10722/152025-
dc.descriptionLNCS v. 7074 is conference proceedings of ISAAC 2011-
dc.description.abstractThe combinatorial group testing problem is concerned with the design of experiments so as to minimize the number of tests needed to find the sets of items responsible for a particular phenotype (an observable property). The traditional group testing problem only considers the OR problem, i.e. the phenotype appears as long as one of the responsible items exists. In this paper, we introduce the phenotype testing problem which is a generalization of the well-studied combinatorial group testing problem. In practice, there are more than one phenotype and the responsible items and their mechanism (AND or OR) for each phenotype are unknown where an AND mechanism means that the phenotype only appears if all of the responsible items exist. This phenotype testing problem has an important application in biological research, known as phenotype knockout study. New algorithms for designing adaptive experiments for solving the phenotype testing problem with n items using O(logn) tests in the worst cases are introduced. When the number of phenotypes is small, say at most 2, and the number of responsible items for each phenotype is at most 2, algorithms with near-optimal number of tests are presented. © 2011 Springer-Verlag.en_US
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_US
dc.relation.ispartofLecture Notes In Computer Scienceen_US
dc.rightsThe original publication is available at www.springerlink.com-
dc.subjectAdaptive phentype testingen_US
dc.subjectCombinatorial group testingen_US
dc.subjectKnockout studyen_US
dc.titleAdaptive phenotype testing for AND/OR itemsen_US
dc.typeConference_Paperen_US
dc.identifier.emailChin, FYL: chin@cs.hku.hken_US
dc.identifier.emailLeung, HCM: cmleung2@cs.hku.hken_US
dc.identifier.emailYiu, SM: smyiu@cs.hku.hken_US
dc.identifier.authorityChin, FYL=rp00105en_US
dc.identifier.authorityLeung, HCM=rp00144en_US
dc.identifier.authorityYiu, SM=rp00207en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1007/978-3-642-25591-5_77en_US
dc.identifier.scopuseid_2-s2.0-84055193609en_US
dc.identifier.hkuros202747-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84055193609&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume7074en_US
dc.identifier.spage754en_US
dc.identifier.epage763en_US
dc.publisher.placeGermanyen_US
dc.description.otherThe 22nd International Symposium on Algorithms and Computation (ISAAC 2011), Yokohama, Japan, 5-8 December 2011. In Lecture Notes In Computer Science, 2011, v. 7074, p. 754-763-
dc.identifier.scopusauthoridYiu, SM=7003282240en_US
dc.identifier.scopusauthoridLeung, HCM=35233742700en_US
dc.identifier.scopusauthoridChin, FYL=7005101915en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats