The Enhanced Double Digest Problem for DNA Physical Mapping
Ming-Yang Kao, Jared Samet, Wing-Kin Sung
Abstract
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.
Create a lesson
Related papers
MindVLM: Neural-Grounded Visual Captioning via Subject-Aware Semantic Evidence Selection
Zixiang Yin, Yu-Ping Wang, Zhengming Ding
Mesh-Native Tokenisation: Retrofitting Foundation Models to Unstructured Data
Georg Maierhofer, Miles Cranmer, Payel Mukhopadhyay
AB-PIELMs: Adaptive-Basis Physics-Informed Extreme Learning Machines for Residual-Driven Domain Decomposition
Aldis Daniel, Vikas Dwivedi, Balaji Srinivasan
A joint error metric for scoring CFD against wind tunnel data, scaled by the robust spread of the participants (AutoCFD5 Case 2)
Hendrik Hetmann, Charles Mockett
Sign-Constrained Intervention Effects for Domain-Generalizable ICU World Models
Zhen Xu, Nicholas Konz, Zhen Tan et al.
Synchronization Reveals Market Structure That Classical Randomness Tests Cannot Detect
Nam H. Le