{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T03:27:22Z","timestamp":1764905242452},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290087"},{"type":"electronic","value":"9783540318125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11557067_25","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:02:33Z","timestamp":1129816953000},"page":"303-314","source":"Crossref","is-referenced-by-count":4,"title":["Multiple Structural RNA Alignment with Lagrangian Relaxation"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bauer","sequence":"first","affiliation":[]},{"given":"Gunnar W.","family":"Klau","sequence":"additional","affiliation":[]},{"given":"Knut","family":"Reinert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"90002","key":"25_CR1","doi-asserted-by":"crossref","first-page":"S4","DOI":"10.1093\/bioinformatics\/18.suppl_2.S4","volume":"18","author":"E. Althaus","year":"2002","unstructured":"Althaus, E., Caprara, A., Lenhof, H.-P., Reinert, K.: Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. Bioinformatics\u00a018(90002), S4\u2013S16 (2002)","journal-title":"Bioinformatics"},{"key":"25_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":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-30551-4_12","volume-title":"Algorithms and Computation","author":"M. Bauer","year":"2004","unstructured":"Bauer, M., Klau, G.W.: Structural Alignment of Two RNA Sequences with Lagrangian Relaxation. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 113\u2013123. Springer, Heidelberg (2004)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/565196.565209","volume-title":"Proc. of RECOMB 2002","author":"A. Caprara","year":"2002","unstructured":"Caprara, A., Lancia, G.: Structural Alignment of Large-Size Proteins via Lagrangian Relaxation. In: Proc. of RECOMB 2002, pp. 100\u2013108. ACM Press, New York (2002)"},{"issue":"11","key":"25_CR5","doi-asserted-by":"publisher","first-page":"2079","DOI":"10.1093\/nar\/22.11.2079","volume":"22","author":"S.P. Eddy","year":"1994","unstructured":"Eddy, S.P., Durbin, R.: RNA sequence analysis using covariance models. Nucl. Acids Research\u00a022(11), 2079\u20132088 (1994)","journal-title":"Nucl. Acids Research"},{"key":"25_CR6","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. Evans","year":"1999","unstructured":"Evans, P.: Finding common subsequences with arcs and pseudoknots. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol.\u00a01645, pp. 270\u2013280. Springer, Heidelberg (1999)"},{"issue":"8","key":"25_CR7","doi-asserted-by":"publisher","first-page":"2433","DOI":"10.1093\/nar\/gki541","volume":"33","author":"P. Gardner","year":"2005","unstructured":"Gardner, P., Wilm, A., Washietl, S.: A benchmark of multiple sequence alignment programs upon structural RNAs. Nucl. Acids Res.\u00a033(8), 2433\u20132439 (2005)","journal-title":"Nucl. Acids Res."},{"key":"25_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":"25_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":"25_CR10","doi-asserted-by":"publisher","first-page":"2222","DOI":"10.1093\/bioinformatics\/bth229","volume":"20","author":"I.L. Hofacker","year":"2004","unstructured":"Hofacker, I.L., Bernhart, S.H.F., Stadler, P.F.: Alignment of RNA base pairing probability matrices. Bioinformatics\u00a020, 2222\u20132227 (2004)","journal-title":"Bioinformatics"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1016\/S0022-2836(02)00308-X","volume":"319","author":"I.L. Hofacker","year":"2002","unstructured":"Hofacker, I.L., Fekete, M., Stadler, P.F.: Secondary structure prediction for aligned RNA sequences. J. Mol. Biol.\u00a0319, 1059\u20131066 (2002)","journal-title":"J. Mol. Biol."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(00)00194-3","volume":"104","author":"J. Kececioglu","year":"2000","unstructured":"Kececioglu, J., Lenhof, H.-P., Mehlhorn, K., Mutzel, P., Reinert, K., Vingron, M.: A polyhedral approach to sequence alignment problems. Discrete Applied Mathematics\u00a0104, 143\u2013186 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"25_CR13","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":"25_CR14","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":"25_CR15","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":"25_CR16","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":"25_CR17","doi-asserted-by":"crossref","unstructured":"Siebert, S., Backofen, R.: MARNA: Multiple alignment and consensus structure prediction of RNAs based on sequence structure comparisons. Bioinformatics (2005), (In press)","DOI":"10.1093\/bioinformatics\/bti550"},{"issue":"1","key":"25_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.jmb.2004.07.018","volume":"342","author":"S. Washietl","year":"2004","unstructured":"Washietl, S., Hofacker, I.L.: Consensus folding of aligned sequences as a new measure for the detection of functional RNAs by comparative genomics. J. Mol. Biol.\u00a0342(1), 19\u201330 (2004)","journal-title":"J. Mol. Biol."},{"key":"25_CR19","unstructured":"Waterman, M.S.: Consensus methods for folding single-stranded nucleic adds. In: Mathematical Methods for DNA Sequences, pp. 185\u2013224 (1989)"},{"key":"25_CR20","series-title":"Wiley-Interscience series in discrete mathematics and optimization","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience series in discrete mathematics and optimization. Wiley, Chichester (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11557067_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:00Z","timestamp":1619507340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11557067_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290087","9783540318125"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11557067_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}