A computational model for RNA multiple structural alignment

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

Volumn 3109, Issue , 2004, Pages 254-269

  Davydov, Eugene ^a   Batzoglou, Serafim ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ALIGNMENT; BIOINFORMATICS; GRAPH THEORY; PATTERN MATCHING; POLYNOMIAL APPROXIMATION; RNA;

COMPUTATIONAL MODEL; GRAPH THEORETIC MODELING; MULTIPLE ALIGNMENT; MULTIPLE SEQUENCES; OPTIMAL STRUCTURES; POLYNOMIAL-TIME ALGORITHMS; SECONDARY STRUCTURES; STRUCTURAL ALIGNMENTS;

STRUCTURAL OPTIMIZATION;

EID: 35048886517     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_19     Document Type: Article

References (19)

1. Bafna V, Huson DH. The conserved exon method for gene finding. Proceedings of the Fifth International Conference on Intelligent Systems for Molecular Biology 3-12, 2000.
2. Batzoglou S, Pachter L, Mesirov JP, Berger B, Lander ES. Human and mouse gene structure: Comparative analysis and application to exon prediction. Genome Research 10:950-958, 2000.
3. Bonizzoni P, Vedova GD. The complexity of multiple sequence alignment with SP-score that is a metric. Theoretical Computer Science 259:63-79, 2001.
4. Cook SA. The complexity of theorem-proving procedures. Proceedings of the Third ACM Symposium on Theory of Computing 151-158, 1971.
5. Eddy SR. Noncoding RNA genes and the modern RNA world. Nature Review Genetics 2:919-929, 2001.
6. Eddy SR. Computational genomics of noncoding RNA genes. Cell 109:137-140, 2002.
7. Floyd RW. Algorithm 97: Shortest path. Comm. ACM 5:345, 1962.
8. Hardison RC, Oeltjen J, Miller W. Long Human-Mouse Sequence Alignments Reveal Novel Regulatory Elements: A Reason to Sequence the Mouse Genome. Genome Research 7:959-966, 1997.
9. Holmes I, Rubin GM. Pairwise RNA Structure Comparison with Stoachastic Context-Free Grammars. Pacific Symposium on Biocomputing 7:175-186.
10. Jareborg N, Birney E, Durbin R. Comparative analysis of noncoding regions of 77 orthologous mouse and human gene pairs. Genome Research 9:815-824, 1999.
11. Kasami T. An efficient recognition and syntax algorithm for context-free languages. Technical Report AF-CRL-65-758, Air Force Cambridge Research Laboratory, Bedford, MA, 1965.
12. Lowe TM, Eddy SR. tRNAscan-SE: a Program For Improved Detection of Transfer RNA genes in Genomic Sequence. Nucleic Acids Research 25:955-964, 1997.
13. Nussinov R, Pieczenik G, Griggs JR, Kleitman DJ. Algorithms for loop matching. SIAM Journal of Applied Mathematics 35:68-82, 1978
14. Pennacchio L, Rubin E. Genomic strategies to identify mammalian regulatory sequences. Nature Reviews 2:100-109, 2001.
15. Rivas E, Eddy SR. A dynamic programming algorithm for RNA structure prediction including pseudoknots. Journal of Molecular Biology 285:2053-2068, 1999.
16. Rivas E, Eddy SR. Secondary structure alone is generally not statistically significant for the detection of noncoding RNAs. Bioinformatics 16:573-583, 2000.
17. Wang L, Jiang T. On the complexity of multiple sequence alignment. Journal of Computational Biology 1:337-348, 1994.
18. Zuker M, Stiegler P. Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Research 9:133-148, 1981.
19. Zuker M. Computer Prediction of RNA structure. Methods in Enzymology 180:262-288, 1989.