{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:57:15Z","timestamp":1773273435300,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T00:00:00Z","timestamp":1322784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10479-011-1028-7","type":"journal-article","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T17:05:58Z","timestamp":1322845558000},"page":"663-682","source":"Crossref","is-referenced-by-count":12,"title":["Efficient solutions for the far from most string problem"],"prefix":"10.1007","volume":"196","author":[{"given":"Paola","family":"Festa","sequence":"first","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,2]]},"reference":[{"key":"1028_CR1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"R. M. Aiex","year":"2002","unstructured":"Aiex, R. M., Resende, M. G. C., & Ribeiro, C. C. (2002). Probability distribution of solution time in grasp: an experimental investigation. Journal of Heuristics, 8, 343\u2013373.","journal-title":"Journal of Heuristics"},{"key":"1028_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and approximation","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., & Protasi, M. (1999). Complexity and approximation. Berlin: Springer."},{"key":"1028_CR3","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J. C. Bean","year":"1994","unstructured":"Bean, J. C. (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6, 154\u2013160.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"1028_CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10479-005-2043-3","volume":"136","author":"P. Dom\u00ednguez-Mar\u00edn","year":"2005","unstructured":"Dom\u00ednguez-Mar\u00edn, P., Nickel, S., Hansen, P., & Mladenovi\u0107, N. (2005). Heuristic procedures for solving the discrete ordered median problem. Annals of Operations Research, 136(1), 145\u2013173.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"1028_CR5","first-page":"98","volume":"4","author":"T. Easton","year":"2007","unstructured":"Easton, T., & Singireddy, A. (2007). A specialized branching and fathoming technique for the longest common subsequence problem. International Journal of Operational Research, 4(2), 98\u2013104.","journal-title":"International Journal of Operational Research"},{"key":"1028_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BFb0029725","volume-title":"Proceedings of 1st workshop on parallel problem solving from nature","author":"A. E. Eiben","year":"1991","unstructured":"Eiben, A. E., Aarts, E. H. L., & Van Hee, K. M. (1991). Global convergence of genetic algorithms: A Markov chain analysis. In Lecture Notes in Computer Science: Vol. 496. Proceedings of 1st workshop on parallel problem solving from nature (pp. 3\u201312). Berlin: Springer."},{"key":"1028_CR7","first-page":"43","volume-title":"Complexity of computation","author":"R. Fagin","year":"1974","unstructured":"Fagin, R. (1974). Generalized first-order spectra and polynomial time recognizable sets. In R. Karp (Ed.), Complexity of computation (pp. 43\u201373). Providence: Am. Math. Soc."},{"key":"1028_CR8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T. A. Feo","year":"1989","unstructured":"Feo, T. A., & Resende, M. G. C. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8, 67\u201371.","journal-title":"Operations Research Letters"},{"key":"1028_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. A. Feo","year":"1995","unstructured":"Feo, T. A., & Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"1028_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.mbs.2006.11.012","volume":"207","author":"P. Festa","year":"2007","unstructured":"Festa, P. (2007). On some optimization problems in molecular biology. Mathematical Biosciences, 207(2), 219\u2013234.","journal-title":"Mathematical Biosciences"},{"key":"1028_CR11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-1-4615-1507-4_15","volume-title":"Essays and surveys on metaheuristics","author":"P. Festa","year":"2002","unstructured":"Festa, P., & Resende, M. G. C. (2002). GRASP: An annotated bibliography. In C. C. Ribeiro & P. Hansen (Eds.), Essays and surveys on metaheuristics (pp. 325\u2013367). Dordrecht: Kluwer Academic."},{"key":"1028_CR12","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"Fleurent, C., & Ferland, J. A. (1996). Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63, 437\u2013461.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"1028_CR13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M. Frances","year":"1997","unstructured":"Frances, M., & Litman, A. (1997). On covering problems of codes. Theory of Computing Systems, 30(2), 113\u2013119.","journal-title":"Theory of Computing Systems"},{"key":"1028_CR14","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman."},{"key":"1028_CR15","first-page":"1","volume-title":"Interfaces in computer science and operations research","author":"F. Glover","year":"1996","unstructured":"Glover, F. (1996). Tabu search and adaptive memory programming: Advances, applications and challenges. In R. Barr, R. Helgason, & J. Kennington (Eds.), Interfaces in computer science and operations research (pp. 1\u201375). Dordrecht: Kluwer Academic."},{"key":"1028_CR16","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"D. E. Goldberg","year":"1989","unstructured":"Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading: Addison-Wesley."},{"key":"1028_CR17","first-page":"1","volume-title":"Proceedings of the second international conference on genetic algorithms (Lawrence Erlbaum associates)","author":"D. E. Goldberg","year":"1987","unstructured":"Goldberg, D. E., & Segrest, P. (1987). Finite Markov chain analysis of genetic algorithms. In J. J. Grefenstette (Ed.), Proceedings of the second international conference on genetic algorithms (Lawrence Erlbaum associates) (pp. 1\u20138)."},{"issue":"11","key":"1028_CR18","doi-asserted-by":"crossref","first-page":"3636","DOI":"10.1016\/j.cor.2007.04.002","volume":"35","author":"F. C. Gomes","year":"2008","unstructured":"Gomes, F. C., Meneses, C. N., Pardalos, P. M., & Viana, G. V. R. (2008). A parallel multistart algorithm for the closest string problem. Computers & Operations Research, 35(11), 3636\u20133643.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"1028_CR19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0377-2217(97)00039-8","volume":"105","author":"H. A. Guvenir","year":"1998","unstructured":"Guvenir, H. A., & Erel, E. (1998). Multicriteria inventory classification using a genetic algorithm. European Journal of Operational Research, 105(1), 29\u201337.","journal-title":"European Journal of Operational Research"},{"key":"1028_CR20","volume-title":"Adaptation in natural and artificial systems","author":"J. H. Holland","year":"1975","unstructured":"Holland, J. H. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press."},{"key":"1028_CR21","unstructured":"Hollstein, R. B. (1971). Artificial genetic adaptation in computer control systems. PhD thesis, 1971."},{"key":"1028_CR22","volume-title":"Genetic programming III, Darwinian invention and problem solving","author":"J. R. Koza","year":"1999","unstructured":"Koza, J. R., Bennett, F. H. III, Andre, D., & Keane, M. A. (1999). Genetic programming III, Darwinian invention and problem solving. San Mateo: Morgan Kaufmann."},{"key":"1028_CR23","first-page":"633","volume-title":"Proceedings of the annual ACM-SIAM symposium on discrete algorithms (SODA)","author":"J. Lanctot","year":"1999","unstructured":"Lanctot, J., Li, M., Ma, B., Wang, S., & Zhang, L. (1999). Distinguishing string selection problems. In Proceedings of the annual ACM-SIAM symposium on discrete algorithms (SODA) (pp. 633\u2013642)."},{"issue":"1","key":"1028_CR24","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"J. Lanctot","year":"2003","unstructured":"Lanctot, J., Li, M., Ma, B., Wang, S., & Zhang, L. (2003). Distinguishing string selection problems. Information and Computation, 185(1), 41\u201355.","journal-title":"Information and Computation"},{"key":"1028_CR25","first-page":"473","volume-title":"Proceedings of the annual ACM symposium on theory of computing","author":"M. Li","year":"1999","unstructured":"Li, M., Ma, B., & Wang, L. (1999). Finding similar regions in many strings. In Proceedings of the annual ACM symposium on theory of computing (pp. 473\u2013482)."},{"issue":"1\u20134","key":"1028_CR26","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02022092","volume":"21","author":"G. E. Liepins","year":"1989","unstructured":"Liepins, G. E., & Hilliard, M. R. (1989). Genetic algorithms: Foundations and applications. Annals of Operations Research, 21(1\u20134), 31\u201358.","journal-title":"Annals of Operations Research"},{"key":"1028_CR27","first-page":"326","volume-title":"Proceedings of the fourth Brazilian symposium on mathematical and computational biology\/first international symposium on mathematical and computational biology","author":"C. N. Meneses","year":"2005","unstructured":"Meneses, C. N., Gomes, F. C., Pardalos, P. M., & Viana, G. V. R. (2005a). Parallel algorithm for the closest string problem. In R. Mondaini (Ed.), Proceedings of the fourth Brazilian symposium on mathematical and computational biology\/first international symposium on mathematical and computational biology (Vol. 2, pp. 326\u2013332)."},{"issue":"3","key":"1028_CR28","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/MEMB.2005.1436464","volume":"24","author":"C. N. Meneses","year":"2005","unstructured":"Meneses, C. N., Oliveira, C. A. S., & Pardalos, P. M. (2005b). Optimization techniques for string selection and comparison problems in genomics. IEEE Engineering in Medicine and Biology Magazine, 24(3), 81\u201387.","journal-title":"IEEE Engineering in Medicine and Biology Magazine"},{"key":"1028_CR29","first-page":"300","volume-title":"Proceedings of the fourth Brazilian symposium on mathematical and computational biology \/ first international symposium on mathematical and computational biology","author":"C. A. S. Oliveira","year":"2005","unstructured":"Oliveira, C. A. S., & Pardalos, P. M. (2005). Network flow algorithm for the longest common subsequence problem. In R. Mondaini (Ed.), Proceedings of the fourth Brazilian symposium on mathematical and computational biology \/ first international symposium on mathematical and computational biology (Vol. 2, pp. 300\u2013313)."},{"key":"1028_CR30","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/ijoc.1040.0090","volume":"16","author":"P. M. Pardalos","year":"2004","unstructured":"Pardalos, P. M., Oliveira, C. A. S., Lu, Z., & Meneses, C. N. (2004). Optimal solutions for the closest string problem via integer programming. INFORMS Journal on Computing, 16, 419\u2013429.","journal-title":"INFORMS Journal on Computing"},{"key":"1028_CR31","volume-title":"State-of-the-art handbook of metaheuristics","author":"M. G. C. Resende","year":"2002","unstructured":"Resende, M. G. C., & Ribeiro, C. C. (2002). Greedy randomized adaptive search procedures. In F. Glover & G. Kochenberger (Eds.), State-of-the-art handbook of metaheuristics Dordrecht: Kluwer Academic."},{"key":"1028_CR32","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/0-387-25383-1_2","volume-title":"Metaheuristics: progress as real problem solvers","author":"M. G. C. Resende","year":"2005","unstructured":"Resende, M. G. C., & Ribeiro, C. C. (2005). GRASP and path-relinking: Recent advances and applications. In T. Ibaraki, K. Nonobe, & M. Yagiura (Eds.), Metaheuristics: progress as real problem solvers (pp. 29\u201363). Berlin: Springer."},{"key":"1028_CR33","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2178-2","volume-title":"Coding and information theory","author":"S. Roman","year":"1992","unstructured":"Roman, S. (1992). Graduate Texts in Mathematics: Vol. 134. Coding and information theory. Berlin: Springer."},{"key":"1028_CR34","first-page":"107","volume-title":"Proceedings of the annual Australasian workshop on combinatorial algorithms (AWOCA)","author":"J. S. Sim","year":"1999","unstructured":"Sim, J. S., & Park, K. (1999). The consensus string problem for a metric is NP-complete. In Proceedings of the annual Australasian workshop on combinatorial algorithms (AWOCA) (pp. 107\u2013113)."},{"issue":"8","key":"1028_CR35","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0898-1221(96)00034-X","volume":"31","author":"D. Wang","year":"1996","unstructured":"Wang, D., & Fang, S.-C. (1996). A semi-infinite programming model for earliness\/tardiness production planning with a genetic algorithm. Computers & Mathematics with Applications, 31(8), 95\u2013106.","journal-title":"Computers & Mathematics with Applications"},{"key":"1028_CR36","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1023\/A:1018919205346","volume":"86","author":"A. R. P. White","year":"1996","unstructured":"White, A. R. P., Mann, J. W., & Smith, G. D. (1996). Genetic algorithms and network ring design. Annals of Operations Research, 86, 347\u2013374.","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-1028-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-1028-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-1028-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:10Z","timestamp":1559153290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-1028-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,2]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1028"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-1028-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,2]]}}}