{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T13:47:17Z","timestamp":1764251237755},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202028"},{"type":"electronic","value":"9783540451938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45193-8_83","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:35:03Z","timestamp":1283974503000},"page":"940-944","source":"Crossref","is-referenced-by-count":2,"title":["A SAT-Based Approach to Multiple Sequence Alignment"],"prefix":"10.1007","author":[{"given":"Steven","family":"Prestwich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Des","family":"Higgins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orla","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"83_CR1","doi-asserted-by":"crossref","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\u00a0(Suppl. 2), S4\u2013S16","DOI":"10.1093\/bioinformatics\/18.suppl_2.S4"},{"key":"83_CR2","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1006\/jmbi.1996.0679","volume":"264","author":"O. Gotoh","year":"1996","unstructured":"Gotoh, O.: Significant Improvement in Accuracy of Multiple Protein Sequence Alignments by Iterative Refinement as Assessed by Reference to Structural Alignments. Journal of Molecular Biology\u00a0264, 823\u2013838 (1996)","journal-title":"Journal of Molecular Biology"},{"key":"83_CR3","unstructured":"Kececioglu, J.D.: Exact and Approximation Algorithms for DNA Sequence Reconstruction. PhD thesis, University of Arizona (1991)"},{"key":"83_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(00)00194-3","volume":"104","author":"J.D. Kececioglu","year":"2000","unstructured":"Kececioglu, J.D., 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"},{"key":"83_CR5","doi-asserted-by":"publisher","first-page":"2469","DOI":"10.1002\/pro.5560071126","volume":"7","author":"K. Mizuguchi","year":"1998","unstructured":"Mizuguchi, K., Deane, C.M., Blundell, T.L., Overington, J.P.: HOMSTRAD: A Database of Protein Structure Alignments for Homologous Families. Protein Science\u00a07, 2469\u20132471 (1998)","journal-title":"Protein Science"},{"key":"83_CR6","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S.B. Needleman","year":"1970","unstructured":"Needleman, S.B., Wunsch, C.D.: A General Method Applicable to the Search of Similarities in the Amino Acid Sequences of Two Proteins. Journal of Molecular Biology\u00a048, 443\u2013453 (1970)","journal-title":"Journal of Molecular Biology"},{"key":"83_CR7","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1093\/nar\/24.8.1515","volume":"2","author":"C. Notredame","year":"1996","unstructured":"Notredame, C., Higgins, D.G.: SAGA: Sequence Alignment by Genetic Algorithm. Nucleic Acids Research\u00a02, 1515\u20131524 (1996)","journal-title":"Nucleic Acids Research"},{"key":"83_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jmbi.2000.4042","volume":"302","author":"C. Notredame","year":"2000","unstructured":"Notredame, C., Higgins, D.G., Heringa, J.: T-COFFEE:A Novel Method for Fast and Accurate Multiple Sequence Alignment. Journal of Molecular Biology\u00a0302, 205\u2013217 (2000)","journal-title":"Journal of Molecular Biology"},{"key":"83_CR9","unstructured":"Prestwich, S.D.: Randomised Backtracking for Linear Pseudo-Boolean Constraint Problems. In: Fourth International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems, le Croisic, France, pp. 7\u201320 (2002)"},{"key":"83_CR10","doi-asserted-by":"crossref","unstructured":"Reinert, K., Lenhof, H.-P., Mutzel, P., Mehlhorn, K., Kececioglu, J.: A Branch-and-Cut Algorithm for Multiple Sequence Alignment. In: First Annual International Conference on Computational Molecular Biology, pp. 241\u2013249 (1997)","DOI":"10.1145\/267521.267845"},{"key":"83_CR11","doi-asserted-by":"publisher","first-page":"4673","DOI":"10.1093\/nar\/22.22.4673","volume":"22","author":"J.D. Thompson","year":"1994","unstructured":"Thompson, J.D., Higgins, D.G., Gibson, T.J.: CLUSTAL W: Improving the Sensitivity of Progressive Multiple Sequence Alignment Through Sequence Weighting, Position-Specific Gap Penalties and Weight Matrix Choice. Nucleic Acids Research\u00a022, 4673\u20134680 (1994)","journal-title":"Nucleic Acids Research"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45193-8_83","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T02:14:33Z","timestamp":1553048073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45193-8_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202028","9783540451938"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45193-8_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}