Abstract
We describe several computational problems on prediction and design of RNA molecules.
This material is based upon work supported by the U.S. National Science Foundation under Grant No. 0130108, by the National Sciences and the Engineering Research Council of Canada, and by the by the Defense Advanced Research Projects Agency (DARPA) and Air Force Research Laboratory, Air Force Materiel Command, USAF, under agreement number F30602-01-2-0555.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Akutsu, “Dynamic programming algorithms for RNA secondary prediction with pseudoknots”, Discrete Applied Mathematics, 104, 2000, 45–62.
M. Andronescu, R. Aquirrez-Hernandez, H. Hoos, and A. Condon, “RNAsoft: a suite of RNA secondary structure prediction and design software tools”, Nucleic Acids Research, In press.
M. Andronescu,, D. Dees, L. Slaybaugh, Y. Zhao, A. Condon, B. Cohen, and S. Skiena, “Algorithms for testing that sets of DNA words concatenate without secondary structure”, Proc. Eighth International Workshop on DNA Based Computers, Hokkaido, Japan, June 2002. To appear in LNCS.
L.M. Adleman, “Molecular computation of solutions to combinatorial problems,” Science, Vol 266, 1994, 1021–1024.
A. Ben-Dor, R. Karp, B. Schwikowski, and Z. Yakhini, “Universal DNA tag systems: a combinatorial design scheme,” Proc. Fourth Annual International Conference on Computational Molecular Biology (RECOMB) 2000, ACM, 65–75.
Braich, R. S., Chelyapov, N., Johnson, C., Rothemund, P. W.K. and Adleman, L. “Solution of a 20-variable 3-SAT Problem on a DNA computer”, Science 296, 2002, 499–502.
S. Brenner, M. Johnson, J. Bridgham, G. Golda, D.H. Lloyd, D. Johnson, S. Luo, S. McCurdy, M. Foy, M, Ewan, R. Roth, D. George, S. Eletr, G. Albrecht, E. Vermaas, S.R. Williams, K. Moon, T. Burcham, M. Pallas, R.B. DuBridge, J. Kirchner, K. Fearon, J. Mao, and K. Corcoran, “Gene expression analysis by massively parallel signature sequencing (MPSS) on microbead arrays,” Nature Biotechnology, 18, 2000, 630–634.
S. Brenner, “Methods for sorting polynucleotides using oligonucleotide tags,” U.S. Patent Number 5,604,097, 1997.
C. Dennis, “The brave new world of RNA”, Nature, 418,11 2002, 122–124.
R. G. Downey and M. R. Fellows, “Fixed-Parameter Tractability and Completeness I: Basic Results”, SIAM J. Comput. 24(4), 1995, 873–921.
D. Faulhammer, A.R. Cukras, R.J. Lipton, and L. F. Landweber, “Molecular computation: RNA solutions to chess problems,” Proc. Natl. Acad. Sci. USA, 97, 2000, 1385–1389.
.P. Gultyaev, F.H.D. van Batenburg, and C.W.A. Pleij, “The computer simulation of RNA folding pathways using a genetic algorithm”, J. Mol. Biol., 250, 1995, 37–51.
I. L. Hofacker, W. Fontana, P. F. Stadler, L. S. Bonhoeffer, M. Tacker, and P. Schuster, “Fast Folding and Comparison of RNA Secondary Structures”, Monatsh.Chem. 125, 1994, 167–188.
M. Jerrum and A. Sinclair, “Approximating the permanent”, SIAM Journal on Computing 18, 1989, 1149–1178.
R.B. Lyngsø and C.N.S. Pedersen, “Pseudoknot prediction in energy based models”, Journal of Computational Biology 7(3), 2000, 409–427.
R. B. Lyngso, M. Zuker, and C. N. S. Pedersen, “Internal Loops in RNA Secondary Structure Prediction”, Proc. Third International Conference in Computational Molecular Biology (RECOMB), April 1999, 260–267.
D.H. Mathews, J. Sabina, M. Zuker, and D.H. Turner, “Expanded sequence dependence of thermodynamic parameters improves prediction of RNA secondary structure”, J. Molecular Biology, 288, 1999, 911–940.
J.S. McCaskill, “The equilibrium partition function and base pair binding probabilities for RNA secondary structure,” Biopolymers, 29, 1990, 1105–1119.
E. Rivas and S. Eddy, “A dynamic programming algorithm for RNA structure prediction including pseudoknots,” Journal of Molecular Biology, 285, 1999, 2053–2068.
P.W.K. Rothemund and E. Winfree, “The program-size complexity of selfassembled squares”, Symposium on Theory of Computing, 2000.
J. SantaLucia, “A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics”, Proc. Natl Acad Sci USA 95:4, 1998, 1460–1465.
N.C. Seeman, “De novo design of sequences for nucleic acid structural engineering,” Journal of Biomolecular Structure and Dynamics, 8:3, 1990, 573–581.
M.J. Serra, D.H. Turner, and S.M. Freier, “Predicting thermodynamic properties of RNA”, Meth. Enzymol., 259, 1995, 243–261.
D. D. Shoemaker, D. A. Lashkari, D. Morris, M. Mittman, and R. W. Davis, “Quantitative phenotypic analysis of yeast deletion mutants using a highly parallel molecular bar-coding strategy,” Nature Genetics, 16, 1996, 450–456.
B.A. Sullenger and E. Gilboa. “Emerging clinical applications of RNA”, Nature, 418, 2002, 252–258.
J.W. Szostak, D.P. Bartel, and L. Luisi. “Synthesizing life”, Nature 409, 2001, 387–389.
I. Tinoco Jr. and C. Bustamante, “How RNA folds”, J. Mol. Biol. 293, 1999, 271–281.
Y. Uemura, A. Hasegawa, Y. Kobayashi, and T. Yokomori, “Tree adjoining grammars for RNA structure prediction”, Theoretical Computer Science, 210, 1999, 277–303.
E. Westhof and V. Fritsch, “RNA folding: beyond Watson-Crick pairs”, Structure 2000, 8:R55–R65, 2000.
E. Winfree, F. Liu, L. Wenzler, and N. Seeman, “Design and self-assembly of 2D DNA crystals,” Nature, 394, 1998, 539–544.
S. Wuchty, W. Fontana, I. L. Hofacker, and P. Schuster, “Complete Suboptimal Folding of RNA and the Stability of Secondary Structures”, Biopolymers, 1998, Vol. 49, 145–165.
M. Zuker and P. Steigler, “Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information,” Nucleic Acids Res 9, 1981, 133–148.
M. Zuker, “On Finding All Suboptimal Foldings of an RNA Molecule”, Science, 244, 1989, 48–52.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Condon, A. (2003). Problems on RNA Secondary Structure Prediction and Design. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_2
Download citation
DOI: https://doi.org/10.1007/3-540-45061-0_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40493-4
Online ISBN: 978-3-540-45061-0
eBook Packages: Springer Book Archive