{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:01:08Z","timestamp":1757779268071,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319547169"},{"type":"electronic","value":"9783319547176"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-54717-6_7","type":"book-chapter","created":{"date-parts":[[2017,3,2]],"date-time":"2017-03-02T20:53:00Z","timestamp":1488487980000},"page":"108-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Finding Median and Center Strings for a Probability Distribution on a Set of Strings Under Levenshtein Distance Based on Integer Linear Programming"],"prefix":"10.1007","author":[{"given":"Morihiro","family":"Hayashida","sequence":"first","affiliation":[]},{"given":"Hitoshi","family":"Koyano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,4]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.patrec.2013.09.014","volume":"36","author":"J Abreu","year":"2014","unstructured":"Abreu, J., Rico-Juan, J.: A new iterative algorithm for computing a quality approximate median of strings based on edit operations. Pattern Recogn. Lett. 36, 74\u201380 (2014)","journal-title":"Pattern Recogn. Lett."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s100440200003","volume":"5","author":"H Bunke","year":"2002","unstructured":"Bunke, H., Jiang, X., Abegglen, K., Kandel, A.: On the weighted mean of a pair of strings. Pattern Anal. Appl. 5, 23\u201330 (2002)","journal-title":"Pattern Anal. Appl."},{"unstructured":"Casacuberta, F., de Antoni, M.: A greedy algorithm for computing approximate median strings. In: Proceedings of National Symposium on Pattern Recognition and Image Analysis, pp. 193\u2013198 (1997)","key":"7_CR3"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1006\/cviu.1998.0599","volume":"70","author":"S Chen","year":"1998","unstructured":"Chen, S., Tung, S., Fang, C., Cherng, S., Jain, A.: Extended attributed string matching for shape recognition. Comput. Vis. Image Underst. 70, 36\u201350 (1998)","journal-title":"Comput. Vis. Image Underst."},{"issue":"6","key":"7_CR5","doi-asserted-by":"publisher","first-page":"e37576","DOI":"10.1371\/journal.pone.0037576","volume":"7","author":"L Dinu","year":"2012","unstructured":"Dinu, L., Ionescu, R.: An efficient rank based based approach for closest string and closest substring. PLoS ONE 7(6), e37576 (2012)","journal-title":"PLoS ONE"},{"unstructured":"Gramm, J.: Fixed-parameter algorithms for the consensus analysis of genomic data. Ph.D. thesis, Universit\u00e4t T\u00fcbingen (2003)","key":"7_CR6"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","volume":"37","author":"J Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37, 25\u201342 (2003)","journal-title":"Algorithmica"},{"key":"7_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, New York (1997)"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"R Hamming","year":"1950","unstructured":"Hamming, R.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29(2), 147\u2013160 (1950)","journal-title":"Bell Syst. Tech. J."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0304-3975(97)00240-5","volume":"230","author":"C Higuera de la","year":"2000","unstructured":"de la Higuera, C., Casacuberta, F.: Topology of strings: median string is NP-complete. Theoret. Comput. Sci. 230, 39\u201348 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1186\/1471-2105-12-106","volume":"12","author":"F Hufsky","year":"2011","unstructured":"Hufsky, F., Kuchenbecker, L., Jahn, K., Stoye, J., B\u00f6cker, S.: Swiftly computing center strings. BMC Bioinform. 12, 106 (2011)","journal-title":"BMC Bioinform."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10044-002-0184-4","volume":"6","author":"X Jiang","year":"2003","unstructured":"Jiang, X., Abegglen, K., Bunke, H., Csirik, J.: Dynamic computation of generalised median strings. Pattern Anal. Appl. 6, 185\u2013193 (2003)","journal-title":"Pattern Anal. Appl."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-70659-3_14","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"X Jiang","year":"2002","unstructured":"Jiang, X., Bunke, H.: Optimal lower bound for generalized median problems in metric space. In: Caelli, T., Amin, A., Duin, R.P.W., Ridder, D., Kamel, M. (eds.) SSPR\/SPR 2002. LNCS, vol. 2396, pp. 143\u2013151. Springer, Heidelberg (2002). doi:\n                    10.1007\/3-540-70659-3_14"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.patrec.2011.07.006","volume":"33","author":"X Jiang","year":"2012","unstructured":"Jiang, X., Wentker, J., Ferrer, M.: Generalized median string computation by means of string embedding in vector spaces. Pattern Recogn. Lett. 33, 842\u2013852 (2012)","journal-title":"Pattern Recogn. Lett."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0167-8655(85)90061-3","volume":"3","author":"T Kohonen","year":"1985","unstructured":"Kohonen, T.: Median strings. Pattern Recogn. Lett. 3, 309\u2013313 (1985)","journal-title":"Pattern Recogn. Lett."},{"issue":"6","key":"7_CR16","doi-asserted-by":"publisher","first-page":"061912","DOI":"10.1103\/PhysRevE.81.061912","volume":"81","author":"H Koyano","year":"2010","unstructured":"Koyano, H., Kishino, H.: Quantifying biodiversity and asymptotics for a sequence of random strings. Phys. Rev. E 81(6), 061912 (2010)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1137\/1025045","volume":"25","author":"J Kruskal","year":"1983","unstructured":"Kruskal, J.: An overview of sequence comparison: time warps, string edits, and macromolecules. SIAM Rev. 25(2), 201\u2013237 (1983)","journal-title":"SIAM Rev."},{"issue":"4","key":"7_CR18","first-page":"845","volume":"163","author":"V Levenshtein","year":"1965","unstructured":"Levenshtein, V.: Binary codes capable of correcting deletions, insertions and reversals. Doklady Adademii Nauk SSSR 163(4), 845\u2013848 (1965)","journal-title":"Doklady Adademii Nauk SSSR"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1006\/cviu.1996.0502","volume":"67","author":"D Lopresti","year":"1997","unstructured":"Lopresti, D., Zhou, J.: Using consensus sequence voting to correct OCR errors. Comput. Vis. Image Underst. 67(1), 39\u201347 (1997)","journal-title":"Comput. Vis. Image Underst."},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0167-8655(02)00209-X","volume":"24","author":"C Mart\u00ednez-Hinarejos","year":"2003","unstructured":"Mart\u00ednez-Hinarejos, C., Juan, A., Casacuberta, F.: Median strings for k-nearest neighbour classification. Pattern Recogn. Lett. 24, 173\u2013181 (2003)","journal-title":"Pattern Recogn. Lett."},{"key":"7_CR21","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). doi:\n                    10.1007\/3-540-44888-8_23"},{"key":"7_CR22","doi-asserted-by":"publisher","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, 390\u2013415 (2005)","journal-title":"J. Discrete Algorithms"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-89689-0_47","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"C Olivares-Rodr\u00edguez","year":"2008","unstructured":"Olivares-Rodr\u00edguez, C., Oncina, J.: A stochastic approach to median string computation. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) SSPR\/SPR 2008. LNCS, vol. 5342, pp. 431\u2013440. Springer, Heidelberg (2008). doi:\n                    10.1007\/978-3-540-89689-0_47"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S1570-8667(03)00011-X","volume":"1","author":"JS Sim","year":"2003","unstructured":"Sim, J.S., Park, K.: The consensus string problem for a metric is NP-complete. J. Discrete Algorithms 1, 111\u2013117 (2003)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"7_CR25","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R Wagner","year":"1974","unstructured":"Wagner, R., Fischer, M.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"unstructured":"Winkler, W.: String comparator metrics and enhanced decision rules in the Fellegi-Sunter model of record linkage. In: Proceedings of the Section on Survey Research Methods, pp. 354\u2013359 (1990)","key":"7_CR26"}],"container-title":["Communications in Computer and Information Science","Biomedical Engineering Systems and Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-54717-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:15:53Z","timestamp":1558394153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-54717-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319547169","9783319547176"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-54717-6_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"4 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIOSTEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Biomedical Engineering Systems and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"biostec2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/biostec.org\/?y=2016","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}