The Double Digest Problem: finding all solutions Online publication date: Tue, 22-Sep-2009
by S. Sur-Kolay, S. Banerjee, S. Mukhopadhyaya, C.A. Murthy
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 5, No. 5, 2009
Abstract: The strongly NP-complete Double Digest Problem (DDP), for physical mapping of DNA, is now used for efficient genotyping. Existing methods: are inefficient in tackling large instances; produce only one solution while an instance may have multiple distinct solutions. In this paper, we employ the notion of equivalence among the distinct solutions to obtain almost all of them. Our method comprises two phases: finding a representative from each equivalence class using an elitist Genetic Algorithm (GA); for each representative generating the entire class efficiently. Experimental results tally for known instances. Significant reduction in search space provides notable efficiency.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com