{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T15:10:28Z","timestamp":1715958628858},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s10100-013-0324-5","type":"journal-article","created":{"date-parts":[[2013,8,31]],"date-time":"2013-08-31T10:28:25Z","timestamp":1377944905000},"page":"501-524","source":"Crossref","is-referenced-by-count":5,"title":["DCA based algorithms for multiple sequence alignment (MSA)"],"prefix":"10.1007","volume":"22","author":[{"given":"Hoai An","family":"Le Thi","sequence":"first","affiliation":[]},{"given":"Tao","family":"Pham Dinh","sequence":"additional","affiliation":[]},{"given":"Moulay","family":"Belghiti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,1]]},"reference":[{"key":"324_CR1","unstructured":"Bradley PS, Mangasarian OL (1998) Feature selection via concave minimization and support vector machines. In: Proceedings of the fifteenth international conference on machine learning (ICML 1998), pp 82\u201390"},{"key":"324_CR2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/83.661182","volume":"7","author":"A Chambolle","year":"1998","unstructured":"Chambolle A, DeVore RA, Lee NY, Lucier BJ (1998) Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage. IEEE Trans Image Process 7: 319\u2013335","journal-title":"IEEE Trans Image Process"},{"key":"324_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc B 39:1\u201338","journal-title":"J R Stat Soc B"},{"key":"324_CR4","doi-asserted-by":"crossref","unstructured":"Greenberg HJ (2007) Integer quadratic programming models in computational biology. In: Operations research proceedings, vol 2006. Springer, Berlin, pp 83\u201395","DOI":"10.1007\/978-3-540-69995-8_14"},{"key":"324_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences","author":"D Gusfield","year":"1997","unstructured":"Gusfield D (1997) Algorithms on strings, trees, and sequences. Cambridge University Press, Cambridge, MA"},{"key":"324_CR6","doi-asserted-by":"crossref","unstructured":"Kececioglu J (1993) The maximum weight trace problem in multiple sequence alignment. In: Proceedings of the 4th symposium on combinatorial pattern matching, pp 106\u2013119","DOI":"10.1007\/BFb0029800"},{"key":"324_CR7","unstructured":"Kececioglu JD (1991) Exact and approximation algorithms for DNA sequence reconstruction, PhD thesis, University of Arizona"},{"key":"324_CR8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0166-218X(00)00194-3","volume":"104","author":"JD Kececioglu","year":"2000","unstructured":"Kececioglu JD, Lenhof H-P, Mehlhorn K, Mutzel P, Reinert K, Vingron M (2000) A polyhedral approach to sequence alignment problems. Discret Appl Math 104:143\u2013186","journal-title":"Discret Appl Math"},{"key":"324_CR9","unstructured":"Le Thi HA. DC programming and DCA. Available on http:\/\/lita.sciences.univ-metz.fr\/lethi\/DCA.html"},{"key":"324_CR10","doi-asserted-by":"crossref","unstructured":"Le Thi HA, Pham Dinh T (1997) Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J Glob Optim 11(3):253\u2013285","DOI":"10.1023\/A:1008288411710"},{"key":"324_CR11","doi-asserted-by":"crossref","unstructured":"Le Thi HA, Pham Dinh T (2003) Large scale molecular optimization from distances matrices by a DC optimization approach. SIAM J Optim 14(1):77\u2013116","DOI":"10.1137\/S1052623498342794"},{"key":"324_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"HA Le Thi","year":"2005","unstructured":"Le Thi HA, Pham Dinh T (2005) The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann Oper Res 133:23\u201346","journal-title":"Ann Oper Res"},{"key":"324_CR13","unstructured":"Le Thi HA, Pham Dinh T, Le DM (1999) Exact penalty in DC programming. Vietnam J Math 27(2):169\u2013178"},{"key":"324_CR14","doi-asserted-by":"crossref","unstructured":"Le Thi HA, Belghiti M, Tao PD (2007) A new efficient algorithm based on DC programming and DCA for clustering. J Glob Optim 37:593\u2013608","DOI":"10.1007\/s10898-006-9066-4"},{"key":"324_CR15","unstructured":"Le Thi HA, Pham Dinh T, Huynh VN (2009) Convergence analysis of DC algorithms for DC programming with subanalytic data. Research report, National Institute for Applied Sciences, Rouen"},{"issue":"3","key":"324_CR16","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 (1998) A polyhedral approach to RNA sequence structure alignment. J\u00a0Comput Biol 5(3):517\u2013530","journal-title":"J\u00a0Comput Biol"},{"key":"324_CR17","first-page":"571","volume":"11","author":"MA McClure","year":"1994","unstructured":"McClure MA, Vasi TK, Fitch WM (1994) Comparative analysis of multiple protein-sequence alignment methods. Mol Biol Evol 11:571\u2013592","journal-title":"Mol Biol Evol"},{"issue":"1","key":"324_CR18","first-page":"11","volume":"4","author":"E Myers","year":"1988","unstructured":"Myers E, Miller W (1988) Optimal alignments in linear space. Comput Appl Biosci 4(1):11\u201317","journal-title":"Comput Appl Biosci"},{"key":"324_CR19","doi-asserted-by":"crossref","unstructured":"Neumann J, Schn\u00d6rr C, Steidl G (2004) SVM-based feature selection by direct objective minimisation. Pattern recognition. In: Proceedings of 26th DAGM symposium, LNCS, Springer, Aug. 2004","DOI":"10.1007\/978-3-540-28649-3_26"},{"issue":"1","key":"324_CR20","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1517\/14622416.3.1.131","volume":"3","author":"C Notredame","year":"2002","unstructured":"Notredame C (2002) Recent progresses in multiple sequence alignment: a survey. Pharmacogenomics 3(1):131\u2013144","journal-title":"Pharmacogenomics"},{"issue":"8","key":"324_CR21","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1093\/nar\/24.8.1515","volume":"24","author":"C Notredame","year":"1996","unstructured":"Notredame C, Higgins DG (1996) SAGA: sequence alignment by genetic algorithm. Nucleic Acids Res 24(8):1515\u20131524","journal-title":"Nucleic Acids Res"},{"key":"324_CR22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1006\/jmbi.2000.4042","volume":"392","author":"C Notredame","year":"2000","unstructured":"Notredame C, Higgins DG, Heringa J (2000) T-COFFEE: a novel method for fast and accurate multiple sequence alignment. J Mol Biol 392:205\u2013217","journal-title":"J Mol Biol"},{"issue":"1","key":"324_CR23","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh T, Le Thi HA (1997) Convex analysis approach to DC programming: theory, algorithms and applications. Acta Mathematica Vietnamica 22(1):289\u2013355","journal-title":"Acta Mathematica Vietnamica"},{"key":"324_CR24","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T Pham Dinh","year":"1998","unstructured":"Pham Dinh T, Le Thi HA (1998) DC optimization algorithms for solving the trust region subproblem. SIAM J Optim 8:476\u2013505","journal-title":"SIAM J Optim"},{"issue":"1","key":"324_CR25","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 PM, Sahni S, Shaw G (2001a) Efficient algorithms for local alignment search. J Comb Optim 5(1):117\u2013124","journal-title":"J Comb Optim"},{"issue":"1","key":"324_CR26","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/A:1009897903540","volume":"5","author":"S Rajasekaran","year":"2001","unstructured":"Rajasekaran S, Hu Y, Luo J, Nick H, Pardalos PM, Sahni S, Shaw G (2001b) Efficient algorithms for similarity search. J Comb Optim 5(1):125\u2013132","journal-title":"J Comb Optim"},{"key":"324_CR27","doi-asserted-by":"crossref","unstructured":"Reinert K, Lenhof H, Mutzel P, Mehlhorn K, Kececioglu JD (1997) A branch-and-cut algorithm for multiple sequence alignment. RECOMB, pp 241\u2013250","DOI":"10.1145\/267521.267845"},{"key":"324_CR28","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton, NJ"},{"issue":"22","key":"324_CR29","doi-asserted-by":"crossref","first-page":"4673","DOI":"10.1093\/nar\/22.22.4673","volume":"22","author":"JD Thompson","year":"1994","unstructured":"Thompson JD, Higgins DG, Gibson TJ (1994) CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice. Nucleic Acids Res 22(22):4673\u20134680","journal-title":"Nucleic Acids Res"},{"key":"324_CR30","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 (1999) BAliBASE: a benchmark alignments database for the evaluation of multiple sequence alignment programs. Bioinformatics 15:87\u201388","journal-title":"Bioinformatics"},{"key":"324_CR31","doi-asserted-by":"crossref","unstructured":"Yufeng L, Shen X, Doss H (2005) Multicategory $$\\psi $$ \u03c8 -Learning and support vector machine: computational tools. J Comput Graph Stat 14(1): 219\u2013236","DOI":"10.1198\/106186005X37238"},{"issue":"4","key":"324_CR32","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"AL Yuille","year":"2003","unstructured":"Yuille AL, Rangarajan A (2003) The convex concave procedure (CCCP). Neural Comput 15(4):915\u2013936","journal-title":"Neural Comput"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-013-0324-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-013-0324-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-013-0324-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T14:39:11Z","timestamp":1715956751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-013-0324-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,1]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["324"],"URL":"https:\/\/doi.org\/10.1007\/s10100-013-0324-5","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,1]]}}}