{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:33:29Z","timestamp":1740548009610,"version":"3.38.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10479-010-0682-5","type":"journal-article","created":{"date-parts":[[2010,9,17]],"date-time":"2010-09-17T08:56:19Z","timestamp":1284713779000},"page":"75-94","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction"],"prefix":"10.1007","volume":"183","author":[{"given":"Jacek","family":"Blazewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Formanowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawel","family":"Kedziora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawel","family":"Marciniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Przemyslaw","family":"Taront","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,18]]},"reference":[{"key":"682_CR1","first-page":"429","volume":"86","author":"A. A. Andreatta","year":"2005","unstructured":"Andreatta, A. A., & Ribeiro, C. C. (2005). Heuristics for the phylogeny problem. Journal of Heuristics, 86, 429\u2013447.","journal-title":"Journal of Heuristics"},{"key":"682_CR2","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1093\/bioinformatics\/btg402","volume":"20","author":"D. Barker","year":"2004","unstructured":"Barker, D. (2004). LVB: Parsimony and simulated annealing in the search for phylogenetic trees. Bioinformatics, 20, 274\u2013275.","journal-title":"Bioinformatics"},{"key":"682_CR3","first-page":"1138","volume-title":"Lecture notes in computer science","author":"J. Blazewicz","year":"2004","unstructured":"Blazewicz, J., Formanowicz, P., Kedziora, P., & Wojciechowski, P. (2004). Parallel algorithms for evolutionary history reconstruction. In Lecture notes in computer science : Vol.\u00a03019 (pp.\u00a01138\u20131145). Berlin: Springer."},{"key":"682_CR4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0025-5564(86)90161-6","volume":"81","author":"W. H. E. Day","year":"1986","unstructured":"Day, W. H. E., Jonhson, D. S., & Sankoff, D. (1986). The computational complexity of inferring rooted phylogenies by parsimony. Mathematical Biosciences, 81, 33\u201342.","journal-title":"Mathematical Biosciences"},{"key":"682_CR5","volume-title":"National biomedical research foundation","author":"R. V. Eck","year":"1966","unstructured":"Eck, R. V., & Dayhoff, M. O. (1966). Atlas of protein sequence and structure. In National biomedical research foundation. Maryland: Silver Springs."},{"key":"682_CR6","first-page":"105","volume":"27","author":"A. W. F. Edwards","year":"1963","unstructured":"Edwards, A. W. F., & Cavalli-Sforza, L. L. (1963). The reconstruction of evolution. Annals of Human Genetics, 27, 105\u2013106.","journal-title":"Annals of Human Genetics"},{"key":"682_CR7","unstructured":"Edwards, A. W. F., & Cavalli-Sforza, L. L. (1964). Reconstruction of evolutionary trees. In V.\u00a0H. Heywood & J. McNeill (Eds.), Phonetic and phylogenetic classification, systematics association publish: Vol.\u00a06 (pp. 67\u201376) London."},{"key":"682_CR8","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/262793.262798","volume":"40","author":"M. Fayad","year":"1997","unstructured":"Fayad, M., & Schmidt, D. (1997). Object-oriented application frameworks. Communications of the ACM, 40, 32\u201338.","journal-title":"Communications of the ACM"},{"key":"682_CR9","unstructured":"Felsenstein, J. (1989). PHYLIP\u2014Phylogeny Inference Package (Version 3.2), Cladistics, 5."},{"key":"682_CR10","volume-title":"Inferring phylogenies","author":"J. Felsenstein","year":"2004","unstructured":"Felsenstein, J. (2004). Inferring phylogenies. Sunderland: Sinauer Associates."},{"key":"682_CR11","unstructured":"Felsenstein, J. (2005). PHYLIP (Phylogeny Inference Package) version\u00a03.6. Distributed by the author, Department of Genome Sciences, University of Washington, Seattle."},{"key":"682_CR12","doi-asserted-by":"crossref","first-page":"406","DOI":"10.2307\/2412116","volume":"20","author":"W. M. Fitch","year":"1971","unstructured":"Fitch, W. M. (1971). Toward defining the course of evolution: minimum change for a specified tree topology. Systematic Zoology, 20, 406\u2013416.","journal-title":"Systematic Zoology"},{"key":"682_CR13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0196-8858(82)80004-3","volume":"3","author":"L. R. Foulds","year":"1982","unstructured":"Foulds, L. R., & Graham, R. L. (1982). The Steiner problem in phylogeny is NP-complete. Advances in Applied Mathematics, 3, 43\u201349.","journal-title":"Advances in Applied Mathematics"},{"key":"682_CR14","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1007\/11539902_83","volume-title":"ICNC \u201905\u2014first international conference on natural computation","author":"A. Go\u00ebffon","year":"2005","unstructured":"Go\u00ebffon, A., Richer, J. M., & Hao, J. K. (2005). Local search for the maximum parsimony problem. In Lecture notes in computer science : Vol. 3612. ICNC \u201905\u2014first international conference on natural computation (pp. 678\u2013683). Berlin: Springer."},{"key":"682_CR15","doi-asserted-by":"crossref","unstructured":"Go\u00ebffon, A., Richer, J. M., & Hao, J. K. (2008). Progressive tree neighborhood applied to the maximum parsimony problem. IEEE\/ACM Transactions on Computational Biology and Bioinformatics, 5(1).","DOI":"10.1109\/TCBB.2007.1065"},{"key":"682_CR16","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). Tabu search, Part I. ORSA Journal on Computing, 1, 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"682_CR17","first-page":"1","volume-title":"Advances in metaheuristics, optimization and stochastic modeling technologies","author":"F. Glover","year":"1997","unstructured":"Glover, F. (1997). Tabu search and adaptive memory programming\u2014advances, applications and challenges. In Barr, Helgason, & Kenington (Eds.) Advances in metaheuristics, optimization and stochastic modeling technologies (pp. 1\u201375). Boston: Kluwer Academic."},{"key":"682_CR18","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1111\/j.1096-0031.1999.tb00278.x","volume":"15","author":"P. Goloboff","year":"1999","unstructured":"Goloboff, P. (1999). Analyzing large data sets in reasonable times: solution for composite optima. Cladistics, 15, 415\u2013428.","journal-title":"Cladistics"},{"key":"682_CR19","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: Cambridge University Press."},{"key":"682_CR20","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0025-5564(82)90027-X","volume":"59","author":"M. D. Hendy","year":"1982","unstructured":"Hendy, M. D., & Penny, D. (1982). Branch and bound algorithms to determine minimal evolutionary trees. Mathematical Biosciences, 59, 277\u2013290.","journal-title":"Mathematical Biosciences"},{"key":"682_CR21","first-page":"273","volume":"53","author":"P. Kedziora","year":"2005","unstructured":"Kedziora, P., Blazewicz, J., Formanowicz, P., Figlerowicz, M., Alejska, M., Jackowiak, P., Malinowska, N., & Fratczak, A. (2005). Computational methods in diagnostics of chronic hepatitis C. Bulletin of the Polish Academy of Sciences. Technical Sciences, 53, 273\u2013281.","journal-title":"Bulletin of the Polish Academy of Sciences. Technical Sciences"},{"key":"682_CR22","first-page":"1908\u20131917","volume":"176","author":"Y. Lin","year":"2007","unstructured":"Lin, Y., Fang, S., & Thorne, J. (2007). A tabu search algorithm for maximum parsimony phylogeny. European Journal of Operational Research, 176, 1908\u20131917.","journal-title":"European Journal of Operational Research"},{"key":"682_CR23","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1111\/j.1096-0031.1985.tb00410.x","volume":"1","author":"M. Luckow","year":"1985","unstructured":"Luckow, M., & Pimentel, R. A. (1985). Numerical Wagner computer programs. Cladistics, 1, 47\u201366.","journal-title":"Cladistics"},{"key":"682_CR24","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighbourhood search. Computers and Operations Research, 24, 1097\u20131100.","journal-title":"Computers and Operations Research"},{"key":"682_CR25","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195135848.001.0001","volume-title":"Molecular evolution and phylogenetics","author":"M. Nei","year":"2000","unstructured":"Nei, M., & Kumar, S. (2000). Molecular evolution and phylogenetics. New York: Oxford University Press."},{"key":"682_CR26","first-page":"25","volume":"13","author":"S. Nelesen","year":"2008","unstructured":"Nelesen, S., Liu, K., Zhao, D., Linder, C. R., & Warnow, T. (2008). The effect of the guide tree on multiple sequence alignments and subsequent phylogenetic analyses. Pacific Symposium on Biocomputing, 13, 25\u201336.","journal-title":"Pacific Symposium on Biocomputing"},{"key":"682_CR27","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1111\/j.1096-0031.1999.tb00277.x","volume":"15","author":"K. C. Nixon","year":"1999","unstructured":"Nixon, K. C. (1999). The parsimony ratchet, a new method for rapid parsimony analysis. Cladistics, 15, 407\u2013414.","journal-title":"Cladistics"},{"key":"682_CR28","unstructured":"R Development Core Team (2008) A Language and Environment for Statistical Computing. http:\/\/www.R-project.org , R Foundation for Statistical Computing, ISBN 3-900051-07-0."},{"key":"682_CR29","doi-asserted-by":"crossref","unstructured":"Roshan, U., Moret, B. M. E., Williams, T. L., & Warnow, T. (2004). Rec-I-DCM3: a fast algorithmic technique for reconstructing large phylogenetic trees. In Proceedings of the IEEE computational systems bioinformatics conference, 2004.","DOI":"10.1109\/CSB.2004.1332422"},{"key":"682_CR30","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1111\/j.1475-3995.2005.498_1.x","volume":"12","author":"C. C. Ribeiro","year":"2005","unstructured":"Ribeiro, C. C., & Vianna, D. S. (2005). A GRASP\/VND heuristic for the phylogeny problem using a new neighborhood structure. International Transactions in Operational Research, 12, 325\u2013338.","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"682_CR31","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1093\/bioinformatics\/14.2.157","volume":"14","author":"J. Stoye","year":"1998","unstructured":"Stoye, J., Evers, D., & Meyer, F. (1998). Rose: generating sequence families. Bioinformatics, 14(2), 157\u2013163.","journal-title":"Bioinformatics"},{"key":"682_CR32","volume-title":"Introduction to computational molecular biology","author":"J. Setubal","year":"1997","unstructured":"Setubal, J., & Meidanis, J. (1997). Introduction to computational molecular biology. Boston: PWS Publishing Company."},{"key":"682_CR33","unstructured":"Stamatakis, A. (2004). Distributed and parallel algorithms and systems for inference of huge phylogenetic trees based on the maximum likelihood method. Ph.D. thesis, Technische Universit\u00e4t M\u00fcnchen, Germany."},{"key":"682_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","volume":"135","author":"E. D. Taillard","year":"2001","unstructured":"Taillard, E. D., Gambardella, L. M., Gendreau, M., & Potvin, J. (2001). Adaptive memory programming: a\u00a0unified view of metaheuristics. European Journal of Operational Research, 135, 1\u201316.","journal-title":"European Journal of Operational Research"},{"key":"682_CR35","doi-asserted-by":"crossref","first-page":"1596","DOI":"10.1093\/molbev\/msm092","volume":"24","author":"K. Tamura","year":"2007","unstructured":"Tamura, K., Dudley, J., Nei, M., & Kumar, S. (2007). MEGA4: molecular evolutionary genetics analysis (MEGA) software version 4.0. Molecular Biology and Evolution, 24, 1596\u20131599.","journal-title":"Molecular Biology and Evolution"},{"key":"682_CR36","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1504\/IJBRA.2009.024034","volume":"5","author":"G. V. R. Viana","year":"2009","unstructured":"Viana, G. V. R., Gomes, F. A. C., Meneses, C. N., & Ferreira, C. E. (2009). Parallelization of a multi-neighborhood local search heuristic for a phylogeny problem. International Journal of Bioinformatics Research and Applications (IJBRA), 5, 163\u2013177.","journal-title":"International Journal of Bioinformatics Research and Applications (IJBRA)"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10479-010-0682-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T22:00:29Z","timestamp":1740520829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0682-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,18]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["682"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0682-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2010,9,18]]}}}