A Dynamic Programming Algorithm for Finding the Optimal Segmentation of an RNA Sequence in Secondary Structure Predictions
暂无分享,去创建一个
Michela Taufer | Ming-Ying Leung | Kyle L. Johnson | Abel Licon | Kyle L. Johnson | M. Taufer | M. Leung | Abel Licon
[1] Christian N. S. Pedersen,et al. RNA Pseudoknot Prediction in Energy-Based Models , 2000, J. Comput. Biol..
[2] A. E. Walter,et al. Coaxial stacking of helixes enhances binding of oligoribonucleotides and improves predictions of RNA folding. , 1994, Proceedings of the National Academy of Sciences of the United States of America.
[3] Serafim Batzoglou,et al. CONTRAfold: RNA secondary structure prediction without physics-based models , 2006, ISMB.
[4] T. K. Vintsyuk. Speech discrimination by dynamic programming , 1968 .
[5] Niles A. Pierce,et al. An algorithm for computing nucleic acid base‐pairing probabilities including pseudoknots , 2004, J. Comput. Chem..
[6] Irmtraud M. Meyer,et al. A practical guide to the art of RNA gene prediction , 2007, Briefings Bioinform..
[7] Thamar Solorio,et al. On the Effectiveness of Rebuilding RNA Secondary Structures from Sequence Chunks , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.
[8] Robert Giegerich,et al. pknotsRG: RNA pseudoknot folding including near-optimal structures and sliding windows , 2007, Nucleic Acids Res..
[9] E Rivas,et al. A dynamic programming algorithm for RNA structure prediction including pseudoknots. , 1998, Journal of molecular biology.
[10] Michael Zuker,et al. Mfold web server for nucleic acid folding and hybridization prediction , 2003, Nucleic Acids Res..