{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:24:59Z","timestamp":1725575099241},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343813"},{"type":"electronic","value":"9783540343820"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758525_88","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T11:03:32Z","timestamp":1147345412000},"page":"646-653","source":"Crossref","is-referenced-by-count":5,"title":["Multiple Sequence Alignment by Ant Colony Optimization and Divide-and-Conquer"],"prefix":"10.1007","author":[{"given":"Yixin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"88_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1089\/cmb.1994.1.337","volume":"1","author":"L. Wang","year":"1994","unstructured":"Wang, L., Jiang, T.: On the complexity of multiple sequences alignment. Journal of Computational Biology\u00a01, 337\u2013348 (1994)","journal-title":"Journal of Computational Biology"},{"key":"88_CR2","doi-asserted-by":"publisher","first-page":"4412","DOI":"10.1073\/pnas.86.12.4412","volume":"86","author":"D.J. Lipman","year":"1989","unstructured":"Lipman, D.J., Altschul, S.F., Kececioglu, J.D.: A tool for multiple sequence alignment. Proc.Natl. Acad. Sci. USA\u00a086, 4412\u20134415 (1989)","journal-title":"Proc.Natl. Acad. Sci. USA"},{"key":"88_CR3","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/0148063","volume":"48","author":"H. Carrillo","year":"1988","unstructured":"Carrillo, H., Lipman, D.J.: The multiple sequence alignment problem in biology. SIAM J. Appl. Math.\u00a048, 1073\u20131082 (1988)","journal-title":"SIAM J. Appl. Math."},{"issue":"6","key":"88_CR4","first-page":"625","volume":"13","author":"J. Stoye","year":"1997","unstructured":"Stoye, J., Moulton, V., Dress, A.W.: DCA: an efficient implementation of the divide-andconquer approach to simultaneous multiple sequence alignment. Comput. Appl. Biosci.\u00a013(6), 625\u2013626 (1997)","journal-title":"Comput. Appl. Biosci."},{"issue":"9","key":"88_CR5","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1093\/bioinformatics\/16.9.808","volume":"16","author":"K. Reinert","year":"2000","unstructured":"Reinert, K., Stoye, J., Will, T.: An iterative method for faster sum-of-pair multiple sequence alignment. Bioinformatics\u00a016(9), 808\u2013814 (2000)","journal-title":"Bioinformatics"},{"issue":"22","key":"88_CR6","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(22), 4673\u20134680 (1994)","journal-title":"Nucleic Acids Research"},{"key":"88_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF02603120","volume":"25","author":"D.-F. Feng","year":"1987","unstructured":"Feng, D.-F., Doolittle, R.F.: Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Mol. E\u00a025, 351\u2013360 (1987)","journal-title":"J. Mol. E"},{"key":"88_CR8","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1093\/bioinformatics\/14.3.290","volume":"14","author":"B. Morgenstern","year":"1997","unstructured":"Morgenstern, B., Werner, T.: DIALIGN: Finding local similarities by multiple sequence alignment. Bioinformatics vil\u00a014, 290\u2013294 (1997)","journal-title":"Bioinformatics vil"},{"issue":"3","key":"88_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1093\/bioinformatics\/15.3.211","volume":"15","author":"B. Morgenstern","year":"1999","unstructured":"Morgenstern, B.: DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics\u00a015(3), 211\u2013218 (1999)","journal-title":"Bioinformatics"},{"issue":"4","key":"88_CR10","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 Refinements as Assessed by Reference to Structural Alignments. J. Mol. Biol.\u00a0264(4), 823\u2013838 (1996)","journal-title":"J. Mol. Biol."},{"key":"88_CR11","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0022-2836(87)90316-0","volume":"198","author":"G.J. Barton","year":"1987","unstructured":"Barton, G.J., Sternberg, M.J.E.: A strategy for the rapid multiple alignment of protein sequences: confidence levels from tertiary structure comparisons. J. Mol. Biol.\u00a0198, 327\u2013337 (1987)","journal-title":"J. Mol. Biol."},{"key":"88_CR12","first-page":"479","volume":"7","author":"M.P. Berger","year":"1991","unstructured":"Berger, M.P., Munson, P.J.: A novel randomized iterative strategy for aligning multiple protein sequences. Comput. Appl. Biosci.\u00a07, 479\u2013484 (1991)","journal-title":"Comput. Appl. Biosci."},{"key":"88_CR13","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1093\/nar\/24.8.1515","volume":"24","author":"C. Notredame","year":"1996","unstructured":"Notredame, C., Higgins, D.G.: SAGA:sequence alignment by genetic algorithm. Nucleic Acids Res.\u00a024, 1515\u20131524 (1996)","journal-title":"Nucleic Acids Res."},{"key":"88_CR14","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1126\/science.8211139","volume":"262","author":"C.E. Lawrence","year":"1993","unstructured":"Lawrence, C.E., Altschul, S.F., Boguski, M.S., Liu, J.S., Neuwald, A.F., Wootton, J.C.: Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science\u00a0262, 208\u2013214 (1993)","journal-title":"Science"},{"issue":"4","key":"88_CR15","first-page":"419","volume":"10","author":"J. Kim","year":"1994","unstructured":"Kim, J., Pramanik, S., Chung, M.J.: Multiple Sequence Alignment using Simulated Annealing. Comp. Applic. Biosci.\u00a010(4), 419\u2013426 (1994)","journal-title":"Comp. Applic. Biosci."},{"issue":"1","key":"88_CR16","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. J. Mol. Biol.\u00a0302(1), 205\u2013217 (2000)","journal-title":"J. Mol. Biol."},{"issue":"1","key":"88_CR17","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1186\/1471-2105-5-113","volume":"5","author":"R.. Edgar","year":"2004","unstructured":"Edgar, R.: MUSCLE: a multiple sequence alignment method with reduced time and space complexity. BMC Bioinformatics\u00a05(1), 113 (2004)","journal-title":"BMC Bioinformatics"},{"key":"88_CR18","unstructured":"Do, C.B., Brudno, M., Batzoglou, S.: ProbCons: Probabilistic.consistency-based multiple alignment of amino acid sequences. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, pp. 703\u2013708 (2004)"},{"key":"88_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0167-7306(08)60461-5","volume-title":"Computational Methods in Molecular Biology","author":"A. Krogh","year":"1998","unstructured":"Krogh, A.: An introduction to hidden markov models for biological sequences. In: Salzberg, S.L., Searls, D.B., Kasif, S. (eds.) Computational Methods in Molecular Biology, pp. 45\u201363. Elsevier, Amsterdam (1998)"},{"issue":"14","key":"88_CR20","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1093\/nar\/gkf436","volume":"30","author":"K. Katoh","year":"2002","unstructured":"Katoh, K., Misawa, K., Kuma, K.-I., Miyata, T.: MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Res.\u00a030(14), 3059\u20133066 (2002)","journal-title":"Nucleic Acids Res."},{"issue":"1","key":"88_CR21","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1009841718561","volume":"5","author":"P. Zhao","year":"2001","unstructured":"Zhao, P., Jiang, T.: A heuristic algorithm for multiple sequence alignment based on blocks. J. Combinatorial Optimization\u00a05(1), 95\u2013115 (2001)","journal-title":"J. Combinatorial Optimization"},{"issue":"1","key":"88_CR22","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B\u00a026(1), 29\u201341 (1996)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"issue":"8","key":"88_CR23","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"J.W. Gutjahr","year":"2000","unstructured":"Gutjahr, J.W.: A Graph-based Ant System and its convergence. Future Generation Computer Systems\u00a016(8), 873\u2013888 (2000)","journal-title":"Future Generation Computer Systems"},{"issue":"4","key":"88_CR24","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0167-739X(99)00124-7","volume":"17","author":"E.G. Talbi","year":"2001","unstructured":"Talbi, E.G., Roux, O., Fonlupt, C., Robillard, D.: Parallel Ant Colonies for the quadratic assignment problem. Future Generation Computer Systems\u00a017(4), 441\u2013449 (2001)","journal-title":"Future Generation Computer Systems"},{"issue":"8","key":"88_CR25","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/S0167-739X(00)00046-7","volume":"16","author":"V. Maniezzo","year":"2000","unstructured":"Maniezzo, V., Carbonaro, A.: An ANTS heuristic for the frequency assignment problem. Future Generation Computer Systems\u00a016(8), 927\u2013935 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"88_CR26","first-page":"616","volume-title":"Proceedings of the 11th International Conference on Evolutionary Computation","author":"L.M. Gambardella","year":"1996","unstructured":"Gambardella, L.M., Dorigo, M.: Ant-Q: A reinforcement learning approach to the traveling salesman problem. In: Proceedings of the 11th International Conference on Evolutionary Computation, pp. 616\u2013621. IEEE Press, Los Alamitos (1996)"},{"key":"88_CR27","doi-asserted-by":"crossref","unstructured":"Chen, Y., Pan, Y., Chen, L., Chen, J.: Partitioned optimization algorithms for multiple sequence alignment. To appear in The Second IEEE Workshop on High Performance Computing in Medicine and Biology, Vienna, Austria","DOI":"10.1109\/AINA.2006.260"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758525_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T14:58:14Z","timestamp":1553353094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758525_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343813","9783540343820"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11758525_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}