Volume 3, Issue 2 (2012)                   JMBS 2012, 3(2): 13-20 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Montaseri S, Moghadam Charkari N, Zare Mirakabad F. RNA Secondary Structure Prediction Using Heuristic Algorithm. JMBS 2012; 3 (2) :13-20
URL: http://biot.modares.ac.ir/article-22-11796-en.html
1- Tarbiat Modraes University, Tehran
2- Tarbiat Modares University, Tehran
3- Amirkabir University of Technology, Tehran
Abstract:   (10196 Views)
RNAs play a fundamental role in many biological and medical processes and the activity of RNA is directly dependent to itsstructure. Designing RNA structures is a basic problem in biology that is important in the treatment and nanotechnology. In this regard, some algorithms have been formed to predict RNA secondary structure. In this paper, we present an algorithm to accurately predict RNA secondary structure based on minimum free energy and maximum number of adjacent base pairs. This algorithm stands on a heuristic approach, which employs a dot matrix representation of all possible base pairs in RNA. Afterward, stems are extracted from the dot matrix and decreasingly sorted based on their length. Then the stems with equal length are increasingly sorted according to the free energy. Finally, the stems are orderly selected to form RNA secondary structure. The proposed algorithm is performed on some datasets containing CopA, CopT, R1inv, R2inv, Tar, Tar*, DIS, IncRNA54, and RepZ in the bacteria. Experimental results showed high accuracy of 95.71% of the proposed algorithm. This algorithm is run in lower computational time in comparison to the other similar approaches.
Full-Text [PDF 243 kb]   (5577 Downloads)    
Article Type: Research Paper | Subject: biochemistry|Biophysics|Genetics
Received: 2011/11/21 | Accepted: 2012/08/23 | Published: 2013/03/10

Add your comments about this article : Your username or Email:

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.