{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T08:22:36Z","timestamp":1765268556068,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030148119"},{"type":"electronic","value":"9783030148126"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14812-6_10","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T23:44:24Z","timestamp":1554853464000},"page":"154-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for Closest and Farthest String Problems via Rank Distance"],"prefix":"10.1007","author":[{"given":"Liviu P.","family":"Dinu","sequence":"first","affiliation":[]},{"given":"Bogdan C.","family":"Dumitru","sequence":"additional","affiliation":[]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,6]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-319-45587-7_26","volume-title":"Combinatorial Optimization","author":"C Arbib","year":"2016","unstructured":"Arbib, C., Felici, G., Servilio, M., Ventura, P.: Optimum solution of the closest string problem via rank distance. In: Cerulli, R., Fujishige, S., Mahjoub, A.R. (eds.) ISCO 2016. LNCS, vol. 9849, pp. 297\u2013307. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45587-7_26"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Babaie, M., Mousavi, S.R.: A memetic algorithm for closest string problem and farthest string problem. In: 2010 18th Iranian Conference on Electrical Engineering. IEEE, May 2010","DOI":"10.1109\/IRANIANCEE.2010.5507004"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"B\u0101doiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, STOC 2002, pp. 250\u2013257. ACM, New York (2002)","DOI":"10.1145\/509907.509947"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-63220-4_63","volume-title":"Combinatorial Pattern Matching","author":"A Ben-Dor","year":"1997","unstructured":"Ben-Dor, A., Lancia, G., Ravi, R., Perone, J.: Banishing bias from consensus sequences. In: Apostolico, A., Hein, J. (eds.) CPM 1997. LNCS, vol. 1264, pp. 247\u2013261. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63220-4_63"},{"issue":"1\u20132","key":"10_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0304-3975(97)00240-5","volume":"230","author":"C de la Higuera","year":"2000","unstructured":"de la Higuera, C., Casacuberta, F.: Topology of strings: median string is NP-complete. Theor. Comput. Sci. 230(1\u20132), 39\u201348 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10_CR6","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1137\/S0097539701397825","volume":"32","author":"X Deng","year":"2003","unstructured":"Deng, X., Li, G., Li, Z., Ma, B., Wang, L.: Genetic design of drugs without side-effects. SIAM J. Comput. 32(4), 1073\u20131090 (2003)","journal-title":"SIAM J. Comput."},{"key":"10_CR7","volume-title":"Dictionary of Distances","author":"E Deza","year":"2006","unstructured":"Deza, E., Deza, M.: Dictionary of Distances. North-Holland, Amsterdam (2006)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1007\/978-3-540-30586-6_88","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"A Dinu","year":"2005","unstructured":"Dinu, A., Dinu, L.P.: On the syllabic similarities of romance languages. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol. 3406, pp. 785\u2013788. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30586-6_88"},{"issue":"1","key":"10_CR9","first-page":"39","volume":"55","author":"LP Dinu","year":"2003","unstructured":"Dinu, L.P.: On the classification and aggregation of hierarchies with different constitutive elements. Fundam. Inform. 55(1), 39\u201350 (2003)","journal-title":"Fundam. Inform."},{"issue":"8","key":"10_CR10","doi-asserted-by":"crossref","first-page":"e104006","DOI":"10.1371\/journal.pone.0104006","volume":"9","author":"LP Dinu","year":"2014","unstructured":"Dinu, L.P., Ionescu, R., Tomescu, A.: A rank-based sequence aligner with applications in phylogenetic analysis. PLoS ONE 9(8), e104006 (2014)","journal-title":"PLoS ONE"},{"issue":"1\u20133","key":"10_CR11","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.tcs.2006.05.024","volume":"359","author":"LP Dinu","year":"2006","unstructured":"Dinu, L.P., Manea, F.: An efficient approach for the rank aggregation problem. Theor. Comput. Sci. 359(1\u20133), 455\u2013461 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-31265-6_33","volume-title":"Combinatorial Pattern Matching","author":"LP Dinu","year":"2012","unstructured":"Dinu, L.P., Popa, A.: On the closest string via rank distance. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 413\u2013426. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31265-6_33"},{"issue":"3","key":"10_CR13","first-page":"361","volume":"73","author":"LP Dinu","year":"2006","unstructured":"Dinu, L.P., Sgarro, A.: A low-complexity distance for DNA strings. Fundam. Inform. 73(3), 361\u2013372 (2006)","journal-title":"Fundam. Inform."},{"issue":"2","key":"10_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theory Comput. Syst. 30(2), 113\u2013119 (1997)","journal-title":"Theory Comput. Syst."},{"key":"10_CR15","unstructured":"Gagolewski, M.: Data Fusion: Theory, Methods, and Applications. Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland (2015)"},{"key":"10_CR16","unstructured":"Gramm, J., Huffner, F., Niedermeier, R.: Closest strings, primer design, and motif search. In: Currents in Computational Molecular Biology. RECOMB, pp. 74\u201375 (2002)"},{"issue":"4","key":"10_CR17","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1162\/COLI_a_00073","volume":"37","author":"SJ Greenhill","year":"2011","unstructured":"Greenhill, S.J.: Levenshtein distances fail to identify language relationships accurately. Comput. Linguist. 37(4), 689\u2013698 (2011)","journal-title":"Comput. Linguist."},{"key":"10_CR18","series-title":"Advances in Computer Vision and Pattern Recognition","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-30367-3","volume-title":"Knowledge Transfer between Computer Vision and Text Mining - Similarity-Based Learning Approaches","author":"RT Ionescu","year":"2016","unstructured":"Ionescu, R.T., Popescu, M.: Knowledge Transfer between Computer Vision and Text Mining - Similarity-Based Learning Approaches. Advances in Computer Vision and Pattern Recognition. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30367-3"},{"issue":"3","key":"10_CR19","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1162\/COLI_a_00256","volume":"42","author":"RT Ionescu","year":"2016","unstructured":"Ionescu, R.T., Popescu, M., Cahill, A.: String kernels for native language identification: insights from behind the curtains. Comput. Linguist. 42(3), 491\u2013525 (2016)","journal-title":"Comput. Linguist."},{"issue":"3","key":"10_CR20","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"10_CR21","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1093\/bioinformatics\/15.4.265","volume":"15","author":"EV Koonin","year":"1999","unstructured":"Koonin, E.V.: The emerging paradigm and open problems in comparative genomics. Bioinformatics 15(4), 265\u2013266 (1999)","journal-title":"Bioinformatics"},{"issue":"1","key":"10_CR22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"JK Lanctot","year":"2003","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inf. Comput. 185(1), 41\u201355 (2003)","journal-title":"Inf. Comput."},{"issue":"4","key":"10_CR23","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10_CR24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/jcss.2002.1823","volume":"65","author":"M Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: Finding similar regions in many sequences. J. Comput. Syst. Sci. 65(1), 73\u201396 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/11527503_70","volume-title":"Advanced Data Mining and Applications","author":"X Liu","year":"2005","unstructured":"Liu, X., He, H., S\u00fdkora, O.: Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem. In: Li, X., Wang, S., Dong, Z.Y. (eds.) ADMA 2005. LNCS (LNAI), vol. 3584, pp. 591\u2013597. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11527503_70"},{"issue":"4","key":"10_CR26","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/ijoc.1040.0090","volume":"16","author":"CN Meneses","year":"2004","unstructured":"Meneses, C.N., Lu, Z., Oliveira, C.A.S., Pardalos, P.M.: Optimal solutions for the closest-string problem via integer programming. INFORMS J. Comput. 16(4), 419\u2013429 (2004)","journal-title":"INFORMS J. Comput."},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Nerbonne, J., Hinrichs, E.W.: Linguistic distances. In: Proceedings of the Workshop on Linguistic Distances, Sydney, July 2006, pp. 1\u20136 (2006)","DOI":"10.3115\/1641976.1641977"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-44888-8_23","volume-title":"Combinatorial Pattern Matching","author":"F Nicolas","year":"2003","unstructured":"Nicolas, F., Rivals, E.: Complexities of the centre and median string problems. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 315\u2013327. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44888-8_23"},{"issue":"2\u20134","key":"10_CR29","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.jda.2004.08.015","volume":"3","author":"F Nicolas","year":"2005","unstructured":"Nicolas, F., Rivals, E.: Hardness results for the center and median string problems under the weighted and unweighted edit distances. J. Discrete Algorithms 3(2\u20134), 390\u2013415 (2005)","journal-title":"J. Discrete Algorithms"},{"key":"10_CR30","unstructured":"Popescu, M., Dinu, L.P.: Rank distance as a stylistic similarity. In: 22nd International Conference on Computational Linguistics, Posters Proceedings, COLING 2008, 18\u201322 August 2008, Manchester, UK, pp. 91\u201394 (2008)"},{"issue":"1\u20133","key":"10_CR31","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.tcs.2007.05.029","volume":"385","author":"VY Popov","year":"2007","unstructured":"Popov, V.Y.: Multiple genome rearrangement by swaps and by element duplications. Theor. Comput. Sci. 385(1\u20133), 115\u2013126 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Ritter, J.: An efficient bounding sphere. In: Graphics Gems, pp. 301\u2013303. Elsevier (1990)","DOI":"10.1016\/B978-0-08-050753-8.50063-2"},{"key":"10_CR33","doi-asserted-by":"crossref","first-page":"8481","DOI":"10.1038\/ncomms9481","volume":"6","author":"Y Sun","year":"2015","unstructured":"Sun, Y., et al.: Combining genomic and network characteristics for extended capability in predicting synergistic drugs for cancer. Nat. Commun. 6, 8481 (2015)","journal-title":"Nat. Commun."},{"issue":"5","key":"10_CR34","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1142\/S0219720005001508","volume":"3","author":"L Wang","year":"2005","unstructured":"Wang, L., Dong, L.: Randomized algorithms for motif detection. J. Bioinf. Comput. Biol. 3(5), 1039\u20131052 (2005)","journal-title":"J. Bioinf. Comput. Biol."},{"issue":"3\/4","key":"10_CR35","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1089\/106652799318391","volume":"6","author":"JC Wooley","year":"1999","unstructured":"Wooley, J.C.: Trends in computational biology: a summary based on a RECOMB plenary lecture. J. Comput. Biol. 6(3\/4), 459\u2013474 (1999)","journal-title":"J. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14812-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:07:58Z","timestamp":1709824078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14812-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030148119","9783030148126"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14812-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}