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.
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 callMore From: International Journal of Bioinformatics Research and Applications
Disclaimer: 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.
