29 September, 2011. Combinatorial Pattern Matching 2008, Pisa, Italy. 2. String barcoding problem. A string barcoding problem is defined as to find a minimum set of substrings that distinguish between all strings in a given set of strings X of cardinality n.In a biological sense, the strings in X represent a set of genomic sequences known as targets and the substrings serve as probes in a hybridisation experiment.We study here a variant of the string barcoding problem in which the substrings 19
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.