Authors:
Saad Mneimneh
1
;
Syed Ali Ahmed
2
and
Nancy L. Greenbaum
2
Affiliations:
1
Hunter College CUNY, United States
;
2
City University of New York, United States
Keyword(s):
Multiple RNA Interaction, RNA Structure, NP-hardness, Dynamic Programming, Approximation Algorithms, Heuristics.
Related
Ontology
Subjects/Areas/Topics:
Agents
;
Algorithms and Software Tools
;
Artificial Intelligence
;
Bioinformatics
;
Biomedical Engineering
;
Computational Molecular Systems
;
Enterprise Information Systems
;
Information Systems Analysis and Specification
;
Methodologies and Technologies
;
Model Design and Evaluation
;
Operational Research
;
Simulation
;
Structural Bioinformatics
;
Structure Prediction
Abstract:
The interaction of two RNA molecules involves a complex interplay between folding and binding that warranted recent developments in RNA-RNA interaction algorithms. However, biological mechanisms in which more than two RNAs take part in an interaction exist. Therefore, we formulate multiple RNA interaction as a computational problem, which not surprisingly turns out to be NP-complete. Our experiments with approximation algorithms and heuristics for the problem suggest that this formulation is indeed useful to determine interaction patterns of multiple RNAs when information about which RNAs interact is not necessarily available (as opposed to the case of two RNAs where one must interact with the other), and because the resulting RNA structure often cannot be predicated by existing algorithms when RNAs are simply handled in pairs.