{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T05:52:17Z","timestamp":1675835537883},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,4,10]],"date-time":"2010-04-10T00:00:00Z","timestamp":1270857600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s11590-010-0188-8","type":"journal-article","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T00:32:45Z","timestamp":1270773165000},"page":"27-40","source":"Crossref","is-referenced-by-count":2,"title":["New formulations of the multiple sequence alignment problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Thiru S.","family":"Arthanari","sequence":"first","affiliation":[]},{"given":"Hoai An","family":"Le Thi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,10]]},"reference":[{"issue":"10","key":"188_CR1","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"W.P. Adams","year":"1986","unstructured":"Adams W.P., Sherali H.D.: A tight linearization and an algorithm for 0\u20131 quadratic programming problems. Manage Sci 32(10), 1274\u20131290 (1986)","journal-title":"Manage Sci"},{"key":"188_CR2","doi-asserted-by":"crossref","unstructured":"Beasley, J.E.: Obtaining test problems via internet. J. Global Optim. 8, 429\u2013433, http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html (1996)","DOI":"10.1007\/BF02404002"},{"key":"188_CR3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0167-6377(90)90059-E","volume":"9","author":"H.P. Benson","year":"1990","unstructured":"Benson H.P.: Separable concave minimization via partial outer approximation and branch and bound. Oper. Res. Lett. 9, 389\u2013394 (1990)","journal-title":"Oper. Res. Lett."},{"issue":"1, Ser.A","key":"188_CR4","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A. Billionnet","year":"2007","unstructured":"Billionnet A., Elloumi S.: Using a mixed integer quadratic programming solver for unconstrained quadratic 0\u20131 problem. Math. Program. 109(1, Ser.A), 55\u201368 (2007)","journal-title":"Math. Program."},{"key":"188_CR5","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/j.ejor.2006.09.028","volume":"187","author":"A. Caprara","year":"2008","unstructured":"Caprara A.: Constrained 0\u20131 quadratic programming: basic approaches and extensions. Eur. J. Oper. Res. 187, 494\u20131503 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"188_CR6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0167-6377(01)00106-7","volume":"30","author":"R.D. Carr","year":"2002","unstructured":"Carr R.D., Lancia G.: Compact vs exponential-size LP relaxations. Oper. Res. Lett. 30, 57\u201365 (2002)","journal-title":"Oper. Res. Lett."},{"key":"188_CR7","doi-asserted-by":"crossref","unstructured":"Greenberg, H.J.: Integer quadratic programming models in computational biology. Operations Research Proceedings, vol. 2006, pp. 83\u201395. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-69995-8_14"},{"key":"188_CR8","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/moor.12.3.544","volume":"12","author":"B. Kalantari","year":"1987","unstructured":"Kalantari B., Rosen J.B.: Algorithm for global minimization of linearly constrained concave quadratic functions. Math. Oper. Res. 12, 544\u2013561 (1987)","journal-title":"Math. Oper. Res."},{"key":"188_CR9","unstructured":"Kececioglu, J.D.: Exact and approximation algorithms for DNA sequence reconstruction. PhD thesis, University of Arizona (1991)"},{"key":"188_CR10","doi-asserted-by":"crossref","unstructured":"Kececioglu, J.: The maximum weight trace problem in multiple sequence alignment. In: Proceedings of the 4th symposium on combinatorial pattern matching, pp. 106\u2013119 (1993)","DOI":"10.1007\/BFb0029800"},{"key":"188_CR11","doi-asserted-by":"crossref","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. Discret. Appl. Math. 104, 143\u2013186 (2000)","journal-title":"Discret. Appl. Math."},{"issue":"7","key":"188_CR12","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1093\/bioinformatics\/16.7.619","volume":"16","author":"C. Korostensky","year":"2000","unstructured":"Korostensky C., Gonnet G.H.: Using traveling salesman problem algorithms for evolutionary tree construction. Bioinformatics 16(7), 619\u2013627 (2000)","journal-title":"Bioinformatics"},{"key":"188_CR13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"H.A. Le Thi","year":"2005","unstructured":"Le Thi H.A., Pham Dinh T.: The DC (Difference of Convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Annals Oper. Res. 133, 23\u201346 (2005)","journal-title":"Annals Oper. Res."},{"issue":"3","key":"188_CR14","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"H.A. Le Thi","year":"1997","unstructured":"Le Thi H.A., Pham Dinh T.: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J. Global Optim. 11(3), 253\u2013285 (1997)","journal-title":"J. Global Optim."},{"issue":"1\u20132","key":"188_CR15","first-page":"93","volume":"50","author":"H.A. Le Thi","year":"2001","unstructured":"Le Thi H.A., Pham Dinh T.: A continuous approach for large-scale constrained quadratic zero-one programming (In honor of Professor ELSTER, Founder of the Journal Optimization). Optimization 50(1\u20132), 93\u2013120 (2001)","journal-title":"Optimization"},{"key":"188_CR16","unstructured":"Le Thi, H.A., Belghiti, T., T.M., Pham Dinh T.: Mutiple alignment of sequences by a continuous optimisation approach on DC Programing and DCA. In:Proceedings of the international conference on bioinformatics & computational biology, BIOCOMP\u201909 (2009)"},{"issue":"3","key":"188_CR17","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1089\/cmb.1998.5.517","volume":"5","author":"H-P. Lenhof","year":"1998","unstructured":"Lenhof H-P., Retnert K., Vingron M.: A polyhedral approach to RNA sequence structure alignment. J. Comput. Biol. 5(3), 517\u2013530 (1998)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"188_CR18","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1517\/14622416.3.1.131","volume":"3","author":"C. Notredame","year":"2002","unstructured":"Notredame C.: Recent progresses in multiple sequence alignment: a survey. Pharmacogenomics 3(1), 131\u2013144 (2002)","journal-title":"Pharmacogenomics"},{"key":"188_CR19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P.M. Pardalos","year":"1990","unstructured":"Pardalos P.M., Rodgers G.P.: Computational aspects of a branch and bound algorithm for quadratic zero\u2013one programming. Computing 45, 131\u2013144 (1990)","journal-title":"Computing"},{"key":"188_CR20","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to d.c. programming: theory, algorithms and applications. Acta Math. Vietnam. 22(1), 289\u2013355 (1997) (dedicated to Professor Hoang Tuy on the occasion of his 70th birthday)"},{"key":"188_CR21","doi-asserted-by":"crossref","unstructured":"Pham Dinh, T., Nguyen Canh, N., Le Thi, H.A.: An efficient combined DCA and B&B using DC\/SDP relaxation for globally solving binary quadratic programs. J. Global Optim. (2010) doi: 10.1007\/s10898-009-9507-y","DOI":"10.1007\/s10898-009-9507-y"},{"key":"188_CR22","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02283689","volume":"25","author":"A.T. Phillips","year":"1990","unstructured":"Phillips A.T., Rosen J.B.: A parallel algorithm for partially separable non-convex global minimization: linear constraints. Annals Oper. Res. 25, 101\u2013118 (1990)","journal-title":"Annals Oper. Res."},{"key":"188_CR23","unstructured":"Prestwich, S., Higgins, D., O\u2019Sullivan, O.: Pseudo-Boolean multiple sequence alignment, Technical report, TR-03-2003, http:\/\/www.4c.ucc.ie\/web\/techreps.jsp , Cork Constraint Computation Centre, University College, Cork, Ireland (2003)"},{"issue":"1","key":"188_CR24","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1023\/A:1009893719470","volume":"5","author":"S. Rajasekaran","year":"2001","unstructured":"Rajasekaran S., Nick H., Pardalos P.M., Sahni S., Shaw G.: Efficient algorithms for local alignment search. J. Comb. Optim. 5(1), 117\u2013124 (2001)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"188_CR25","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1023\/A:1009893719470","volume":"5","author":"S. Rajasekaran","year":"2001","unstructured":"Rajasekaran S., Hu Y., Luo J., Nick H., Pardalos P.M., Sahni S., Shaw G.: Efficient algorithms for similarity alignment search. J. Comb. Optim. 5(1), 117\u2013124 (2001)","journal-title":"J. Comb. Optim."},{"key":"188_CR26","doi-asserted-by":"crossref","unstructured":"Reinert, K., Lenhof, H., Mutzel, P., Mehlhorn, K., Kececioglu, J.D.: A branch-and-cut algorithm for multiple sequence alignment. RECOMB, pp. 241\u2013250 (1997)","DOI":"10.1145\/267521.267845"},{"issue":"1","key":"188_CR27","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1051\/ro\/1996300100311","volume":"30","author":"P. Thai Quynh","year":"1996","unstructured":"Thai Quynh P., Le Thi H.A., Pham Dinh T.: On the global solution of linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method. RAIRO Rech. Op\u00e9r 30(1), 31\u201349 (1996)","journal-title":"RAIRO Rech. Op\u00e9r"},{"key":"188_CR28","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1093\/bioinformatics\/15.1.87","volume":"15","author":"J. Thompson","year":"1999","unstructured":"Thompson J., Plewniak F., Poch O.: BAliBASE: a benchmark alignments database for the evaluation of multiple sequence alignment programs. Bioinformatics 15, 87\u201388 (1999)","journal-title":"Bioinformatics"},{"key":"188_CR29","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581085","volume":"57","author":"S.A. Vavasis","year":"1992","unstructured":"Vavasis S.A.: Approximation algorithms for indefinite quadratic programming. Math. Program. 57, 279\u2013311 (1992)","journal-title":"Math. Program."},{"key":"188_CR30","volume-title":"Nonlinear optimization, complexity issues","author":"S.A. Vavasis","year":"1991","unstructured":"Vavasis S.A.: Nonlinear optimization, complexity issues. Oxford University Press, New York (1991)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0188-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0188-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0188-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T11:15:04Z","timestamp":1559560504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0188-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,10]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["188"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0188-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,10]]}}}