Abstract
An optimized and parallelized form of a dynamic pro gramming algorithm capable of generating optimal and suboptimal RNA secondary structures is pre sented. Implementation of this algorithm on a MasPar MP-2 with 16K processors is shown to perform ex tremely well for very large nucleic acid sequences such as HIV (AIDS) and Rhinovirus (common cold). These sequences are, respectively, 9,128 and 7,208 nu cleotides in length. By taking advantage of the parallel nature of MasPar and also optimizing the communica tion requirements the implementation essentially re duced the algorithm from order O(n3) to 0(n2). This reduction in complexity enables us to fold large RNA sequences in reasonable amounts of time. This capa bility has proven to be a valuable tool in studying the molecular structure and biological function of mole cules this large.
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 callMore From: The International Journal of Supercomputer Applications and High Performance Computing
Disclaimer: 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.
