Abstract
Due to massive parallelism, enormous memory storage and very low energy consumption, biomolecular operations have been suggested to solve various NP-hard problems that are beyond the capability of the fastest known digital computer. The optimal linear arrangement (OLA) problem is a well-known NP-hard combinatorial optimization problem. Based on a DNA computational model, this paper describes a novel algorithm for the OLA problem, which is executed in O(n 3log2 n) DNA operations on tubes of (nK + n + m + L + 1)-bits DNA strands, where $$K = \left\lceil {\log_2 n} \right\rceil$$ and $$L = \left\lceil {\log _2 \left({nm} \right)} \right\rceil + 1$$ . With the advance in molecular biology techniques, this algorithm may be of practical utility.
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 callDisclaimer: 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.
