{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:58:22Z","timestamp":1725559102703},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_12","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T14:15:37Z","timestamp":1279030537000},"page":"113-123","source":"Crossref","is-referenced-by-count":4,"title":["Structural Alignment of Two RNA Sequences with Lagrangian Relaxation"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gunnar W.","family":"Klau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Algorithmic Solutions. The LEDA User Manual Version 4.5 (2004), http:\/\/www.algorithmic-solutions.com"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Combinatorial Pattern Matching","author":"V. Bafna","year":"1995","unstructured":"Bafna, V., Muthukrishnan, S., Ravi, R.: Computing similarity between RNA strings. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol.\u00a0937, pp. 1\u201316. Springer, Heidelberg (1995)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Cannone, J.J., Subramanian, S., Schnare, M.N., Collett, J.R., D\u2019Souza, L.M., Du, Y., Feng, B., Lin, N., Madabusi, L.V., Muller, K.M., Pande, N., Shang, Z., Yu, N., Gutell, R.R.: The comparative RNA web (CRW) site: an online database of comparative sequence and structure information for ribosomal, intron, and other RNAs. BMC Bioinformatics\u00a03(1) (2002)","DOI":"10.1186\/1471-2105-3-15"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1145\/565196.565209","volume-title":"Proceedings of the Sixth Annual International Conference on Computational Biology","author":"A. Caprara","year":"2002","unstructured":"Caprara, A., Lancia, G.: Structural Alignment of Large-Size Proteins via Lagrangian Relaxation. In: Proceedings of the Sixth Annual International Conference on Computational Biology, pp. 100\u2013108. ACM Press, New York (2002)"},{"issue":"4","key":"12_CR5","first-page":"389","volume":"10","author":"F. Corpet","year":"1994","unstructured":"Corpet, F., Michot, B.: RNAlign program: alignment of RNA sequences using both primary and secondary structures. CABIOS\u00a010(4), 389\u2013399 (1994)","journal-title":"CABIOS"},{"issue":"11","key":"12_CR6","doi-asserted-by":"publisher","first-page":"2079","DOI":"10.1093\/nar\/22.11.2079","volume":"22","author":"S. Eddy","year":"1994","unstructured":"Eddy, S., Durbin, R.: RNA sequence analysis using covariance models. Nucleic Acids Research\u00a022(11), 2079\u20132088 (1994)","journal-title":"Nucleic Acids Research"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-48452-3_20","volume-title":"Combinatorial Pattern Matching","author":"P.A. Evans","year":"1999","unstructured":"Evans, P.A.: Finding common subsequences with arcs and pseudoknots. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol.\u00a01645, pp. 270\u2013280. Springer, Heidelberg (1999)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"3724","DOI":"10.1093\/nar\/25.18.3724","volume":"25","author":"J. Gorodkin","year":"1997","unstructured":"Gorodkin, J., Heyer, L.J., Stormo, G.D.: Finding the most significant common sequence and structure motifs in a set of RNA sequences. Nucl. Acids Res.\u00a025, 3724\u20133732 (1997)","journal-title":"Nucl. Acids Res."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"Held, M., Karp, R.: The traveling-salesman problem and minimum spanning trees: Part II. Mathematical Programming\u00a01, 6\u201325 (1971)","journal-title":"Mathematical Programming"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Hofacker, I.L., Bernhart, S.H.F., Stadler, P.F.: Alignment of RNA base pairing probability matrices. Bioinformatics (2004) (in press)","DOI":"10.1093\/bioinformatics\/bth229"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1089\/cmb.1998.5.517","volume":"5","author":"H.-P. Lenhof","year":"1998","unstructured":"Lenhof, H.-P., Reinert, K., Vingron, M.: A Polyhedral Approach to RNA Sequence Structure Alignment. Journal of Comp. Biology\u00a05(3), 517\u2013530 (1998)","journal-title":"Journal of Comp. Biology"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1006\/jmbi.2001.5351","volume":"317","author":"D.H. Mathews","year":"2002","unstructured":"Mathews, D.H., Turner, D.H.: Dynalign: An algorithm for finding secondary structures common to two RNA sequences. J. Mol. Biol.\u00a0317, 191\u2013203 (2002)","journal-title":"J. Mol. Biol."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1002\/bip.360290621","volume":"29","author":"J.S. McCaskill","year":"1990","unstructured":"McCaskill, J.S.: The Equilibrium Partition Function and Base Pair Binding Probabilities for RNA Secondary Structure. Biopolymers\u00a029, 1105\u20131119 (1990)","journal-title":"Biopolymers"},{"key":"12_CR14","first-page":"593","volume":"8","author":"B. Poljak","year":"1967","unstructured":"Poljak, B.: A general method of solving extremum problems. Soviet Mathematics Doklady\u00a08, 593\u2013597 (1967)","journal-title":"Soviet Mathematics Doklady"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1137\/0145048","volume":"45","author":"D. Sankoff","year":"1985","unstructured":"Sankoff, D.: Simultaneous solution of the RNA folding, alignment, and proto-sequence problems. SIAM J. Appl. Math.\u00a045, 810\u2013825 (1985)","journal-title":"SIAM J. Appl. Math."},{"key":"12_CR16","unstructured":"Waterman, M.: Consensus methods for folding single-stranded nucleic adds. In: Mathematical Methods for DNA Sequences, pp. 185\u2013224 (1989)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1093\/nar\/30.1.183","volume":"30","author":"J. Wuyts","year":"2002","unstructured":"Wuyts, J., Van de Peer, Y., Winkelmans, T., De Wachter, R.: The European database on small subunit ribosomal RNA. Nucleic Acids Res\u00a030, 183\u2013185 (2002)","journal-title":"Nucleic Acids Res"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T06:13:21Z","timestamp":1635660801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}