Structural alignment of two RNA sequences with lagrangian relaxation

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

Volumn 3341, Issue , 2004, Pages 113-123

  Bauer, Markus ^a   Klau, Gunnar W ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; HYDROGEN BONDS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; MOLECULES;

ALIGNMENT ALGORITHMS; BASE PAIRING; COMPUTATIONAL PROBLEM; LAGRANGIAN RELAXATIONS; PRIMARY SEQUENCES; PSEUDO-KNOTS; RNA MOLECULES; RNA SEQUENCES; STRUCTURAL ALIGNMENTS; STRUCTURE FORMATIONS; COMPUTATIONAL EXPERIMENT; INTEGER LINEAR PROGRAMS; LAGRANGIAN RELAXATION;

RNA;

EID: 35048827423     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_12     Document Type: Article

References (17)

1. Algorithmic Solutions. The LEDA User Manual Version 4.5, 2004. http://www.algorithmic-solutions.com.
2. V. Bafna, S. Muthukrishnan, and R. Ravi. Computing similarity between RNA strings. In S. Galil and E. Ukkonen, editors, Proc. of the 6th Annual Symp. on Combinatorial Pattern Matching, number 937 in LNCS, pages 1-16. Springer, 1995.
3. J. J. Cannone, S. Subramanian, M. N. Schnare, J. R. Collett, L. M. D'Souza, Y. Du, B. Feng, N. Lin, L. V. Madabusi, K. M. Muller, N. Pande, Z. Shang, N. Yu, and R. R. Gutell. The comparative RNA web (CRW) site: an online database of comparative sequence and structure information for ribosomal, intron, and other RNAs. BMC Bioinformatics, 3(1), 2002.
4. A. Caprara and G. Lancia. Structural Alignment of Large-Size Proteins via Lagrangian Relaxation. In Proceedings of the Sixth Annual International Conference on Computational Biology, pages 100-108. ACM Press, 2002.
5. F. Corpet and B. Michot. RNAlign program: alignment of RNA sequences using both primary and secondary structures. CABIOS, 10(4):389-399, 1994.
6. S. Eddy and R. Durbin. RNA sequence analysis using covariance models. Nucleic Acids Research, 22(11):2079-2088, 1994.
7. P. A. Evans. Finding common subsequences with arcs and pseudoknots. In M. Crochemore and M. Patterson, editors, Proc. Combinatorial Pattern Matching (CPM'99), volume 1645 of LNCS, pages 270-280. Springer, 1999.
8. J. Gorodkin, L. J. Heyer, and G. D. Stormo. Finding the most significant common sequence and structure motifs in a set of RNA sequences. Nucl. Acids Res.,25:3724-3732, 1997.
9. M. Held and R. Karp. The traveling-salesman problem and minimum spanning trees: Part II. Mathematical Programming, 1:6-25, 1971.
10. I. L. Hofacker, S. H. F. Bernhart, and P. F. Stadler. Alignment of RNA base pairing probability matrices. Bioinformatics, 2004. In press.
11. H.-P. Lenhof, K. Reinert, and M. Vingron. A Polyhedral Approach to RNA Sequence Structure Alignment. Journal of Comp. Biology, 5(3):517-530, 1998.
12. D. H. Mathews and D. H. Turner. Dynalign: An algorithm for finding secondary structures common to two RNA sequences. J. Mol. Biol.,317:191-203, 2002.
13. J. S. McCaskill. The Equilibrium Partition Function and Base Pair Binding Probabilities for RNA Secondary Structure. Biopolymers, 29:1105-1119, 1990.
14. B. Poljak. A general method of solving extremum problems. Soviet Mathematics Doklady, 8:593-597, 1967.
15. D. Sankoff. Simultaneous solution of the RNA folding, alignment, and protosequence problems. SIAM J. Appl. Math.,45:810-825, 1985.
16. M. Waterman. Consensus methods for folding single-stranded nucleic adds. Mathematical Methods for DNA Sequences, pages 185-224, 1989.
17. J. Wuyts, Y. Van de Peer, T. Winkelmans, and R. De Wachter. The European database on small subunit ribosomal RNA. Nucleic Acids Res, 30:183-185, 2002.