Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kim, J.
Right arrow Articles by Pramanik, S.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Kim, J.
Right arrow Articles by Pramanik, S.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

Alignment of possible secondary structures in multiple RNA sequences using simulated annealing

Jin Kim 1, James R. Cole 2 and Sakti Pramanik 1,3

1Department of Computer Science, Michigan State University East Lansing, MI 48824, USA
2Center for Microbial Ecotogy, Michigan State University East Lansing, MI 48824, USA

2To whom correspondence should be addressed E-mail (kimj{at}cps.colej@pilot.pramanik@cps.msu.edu

Multiple sequence alignment has been a useful technique for identifying RNA secondary structures. In this paper, an algorithm for aligning multiple RNA sequences to identify possible secondary structure is presented. In this algorithm, dot matrices generated from intra-sequence comparisons are used to obtain possible common secondary structures. A hit probability for dot matrices is calculated and a score function based on this hit probability is defined. Simulated annealing is applied to optimize the score function. The solution set of multiple sequence alignment is introduced, and the effects on the solution set of increasing the number of alignment gaps and the alignment length are analyzed. Several additional strategies to reduce simulated annealing time are applied. A method is applied to reduce the computation time based on the solution set. Also, an optimized transition rule, double shuffle, which moves two positions in a sequence with each iteration, is applied to increase the rate of convergence. This algorithm was used to find possible common secondary structures in RNA sequences.

Received on October 25, 1995; accepted on June 12, 1996

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Brief BioinformHome page
P. Larranaga, B. Calvo, R. Santana, C. Bielza, J. Galdiano, I. Inza, J. A. Lozano, R. Armananzas, G. Santafe, A. Perez, et al.
Machine learning in bioinformatics
Brief Bioinform, March 1, 2006; 7(1): 86 - 112.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
R. D. M. Page
Comparative analysis of secondary structure of insect mitochondrial small subunit ribosomal RNA using maximum weighted matching
Nucleic Acids Res., October 15, 2000; 28(20): 3839 - 3845.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
J.-H. Chen, S.-Y. Le, and J. V. Maizel
Prediction of common secondary structures of RNAs: a genetic algorithm approach
Nucleic Acids Res., February 15, 2000; 28(4): 991 - 999.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.