Abstract
Abstract Given a finite set of n items, containing at least one defective item, and, for each item, the probability that it is defective, it is desired to determine a group-testing procedure which isolates a single defective with a minimum expected number of tests. We prove that such an optimal procedure can be found by constructing an optimal “alphabetic binary tree” for a derived set of weights obtained directly from the given probabilities. The algorithm for constructing the optimal procedure requires a number of operations proportional only to n log n.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
