The Enhanced Double Digest Problem for DNA Physical Mapping
Kao, Ming-Yang · Samet, Jared · Sung, Wing-Kin
Computational Engineering, Finance, and Science
Discrete Mathematics
Data Structures and Algorithms
F.2.2; G.2.3; J.3
الأصل · EN
The double digest problem is a common NP-hard approach to constructing physical maps of DNA sequences. This paper presents a new approach called the enhanced double digest problem. Although this new problem is also NP-hard, it can be solved in linear time in certain theoretically interesting cases.
الترجمة العربية
لا توجد ترجمة عربية لهذا البحث بعد. كن أوّل من يطلبها: تستغرق ثوانيَ معدودة، وتُحفظ النتيجة لكل قارئ قادم.