A study of accessible motifs and RNA folding complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3909 LNBI, Issue , 2006, Pages 473-487

  Wexler, Ydo ^a   Zilberstein, Chaya ^a   Ziv Ukelson, Michal ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CELLS; DYNAMIC PROGRAMMING; GENE TRANSFER; GENETIC ALGORITHMS; MOLECULAR STRUCTURE; NUCLEIC ACID SEQUENCES; PROTEINS; TISSUE;

POLYMER FOLDING MODELS; RNA FOLDING COMPLEXITY; STRUCTURE PREDICTION; TISSUE-SPECIFIC MICRORNAS;

RNA;

EID: 33745798377     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11732990_40     Document Type: Conference Paper

References (43)

1. A. Aggarawal and J. Park. Notes on searching in multidimensional monotone arrays. Proc. 29th IEEE Symp. on Foundations of Compute r Science, 497-512, 1988.
2. V. Akmaev, S. Kelley, and G. Stormo. A phylogenetic approach to RNA structure prediction. Proc Int Conf Intell Syst Mol Biol, 235:10-17, 1999.
3. Y. Arava, Y. Wang, J. Storey, C. Liu, P. Brown, and D. Herschlag. Genome-wide analysis of mRNA translation profiles in saccharomyces cerevisiae. PNAS, 100:3889-3894, 2003.
4. R. Christofferson et al. Application of computational technologies to ribozyme biotechnology products. J.Molecular Struct. (Theochem), 311:273, 1994.
5. M. Crochemore, G. Landau, B. Schieber, and M. Ziv-Ukelson. Re-Use Dynamic Programming for Sequence Alignment:An Algorithmic Toolkit. String Algorithmics. KCL Press, 2005.
6. D. Draper. Themes in RNA-protein recognition. J Mol Biol, 293(2):255-270, 1999.
7. D. Eppstein, Z. Galil, and R. Giancarlo. Speeding up dynamic programming. Proc. 29th IEEE Symp. on Foundations of Computer Science, 488-496, 1988.
8. M. Fisher. Shape of a self-avoiding walk or polymer chain. JCP, 44:616-622, 1966.
9. Z. Galil and R. Giancarlo. Speeding up dynamic programming with applications to molecular biology. Theoretical Computer Science, 64:107-118, 1989.
10. R. Giancarlo. Dynamic Programming: Special Cases. In Pattern Matching Algorithms, A. Apostolico and Z. Galil eds., Oxford University Press, 1997.
11. E. Goodwin, P. Okkema, T. C. Evans, and J. Kimble. Translational regulation of tra-2 by its 3' untranslated region controls sexual identity in c. elegans. Cell, 75:329-339, 1993.
12. C. Goulden. Methods of Statistical Analysis. New York: Wiley, 2 edition, 1956.
13. N. Gray and M. Wickens. Annu Rev Cell Dev Biol, 14:399-458, 1998.
14. I. L. Hofacker. Vienna RNA secondary structure server. NAR, (13):3429-3431, 2003.
15. A. Jayaraman and S.P.Walton. Rational selection and quantitative evaluation of antisense oligonucleotides. Biochim. Biophys. Acta, 1520:105, 2001.
16. Y. Ji, X. Xu, and G. Stormo. Bioinformatics, 20:1591-1602, 2004.
17. A. Kabakcioglu and A. Stella. A scale-free network hidden in the collapsing polymer. ArXiv Condensed Matter e-prints, Sept. 2004.
18. Y. Kafri, D. Mukamel, and L. Peliti. Why is the dna denaturation transition first order? Physical Review Letters, 85:4988-4991, 2000.
19. L. Larmore and B. Schieber. On-line dynamic programming with applications to the prediction of RNA secondary structure. J. Algorithms, 12(3):490-515, 1991.
20. T. Liu and R. Bundschuh. Quantification of the differences between quenched and annealed averaging for RNA secondary structures. ArXiv Physics e-prints, Apr. 2005.
21. C. Llave et al. Cleavage of scarecrow-like mRNA targets directed by a class of arabidopsis miRNA. Science, 297:2053-2056, 2002.
22. R. B. Lyngsø, M. Zuker, and C. N. S. Pedersen. An improved algorithm for RNA secondary structure prediction. Technical Report RS-99-15, brics, 1999.
23. D. Mathews et al. RNA, 5, 1458-1469, 1999.
24. D. Mathews, J. Sabina, M. Zuker, and D. Turner. JMB, 288:911, 1999.
25. R. Nussinov and A. Jacobson. Fast algorithm for predicting the secondary structure of single-stranded RNA. PNAS, 77(11):6309-6313, 1980.
26. G. Pavesi et al. an algorithm for finding conserved secondary structure motifs in unaligned RNA sequences. NAR, 32:3258-3269, 2004.
27. Robins et al. PNAS, 102:4006-4009, 2005.
28. J. Ross. mRNA stability in mammalian cells. Microbiol Rev, 59(3):423-450, 1995.
29. M. Sagot. Spelling approximate or repeated motifs using a suffix tree. LNCS,111-127, 1998.
30. L. Smith et al. Eur. J. Pharm. Sci., 11:191, 2000.
31. G. Tang et al. framework for RNA silencing in plants. Genes Dev, 17:49-63, 2003.
32. I. Tinoco et al. Nature New Biology, 246:40-41, 1973.
33. C. Vanderzande. Lattice Models of Polymers (Cambridge Lecture Notes in Physics 11). Cambridge University Press, 1998.
34. M. Waterman and T. Smith. Rapid dynamic programming algorithms for RNA secondary structure. Adv. Appl. Math., 7:455-464, 1986.
35. M. Welsh, N. Scherberg, R. Gilmore, and D. Steiner. Translational control of insulin biosynthesis. Biochem. J., 235:459-467, 1986.
36. G. Wilkie, K. Dickson, and N. Gray. Regulation of mRNA translation by 5'- and 3'-utrbinding factors. Trends Biochem Sci, 28:182-188, 2003.
37. E. Yang et al. Decay rates of human mRNAs: correlation with functional characteristics and sequence attributes. Genome Res, 13:1863-1872, 2003.
38. C. Zilberstein, E. Eskin, and Z. Yakhini. Sequence motifs in ranked expression data. In The First RECOMB Satellite Workshop on Regulatory Genomics, 2004.
39. C. Zilberstein, M. Ziv-Ukelson, R. Y. Pinter, and Z. Yakhini. A high-throughput approach for associating microRNAs with their activity conditions. In RECOMB, 133-151, 2005.
40. A. Zubiaga, J. Belasco, and M. Greenberg. The nonamer uuauuuauu is the key au-rich sequence motif that mediates mRNA degradation. Mol.Cell.Biol., 15:2219-2230, 1995.
41. M. Zuker. Computer prediction of RNA structure. Methods Enzymol., 180:262-288, 1989.
42. M. Zuker. NAR, (13):3406-15, 2003.
43. M. Zuker and P. Stiegler. Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. NAR, 9(1):133-148, 1981.