{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T14:21:00Z","timestamp":1648650060896},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,9,23]],"date-time":"2014-09-23T00:00:00Z","timestamp":1411430400000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00373-014-1467-4","type":"journal-article","created":{"date-parts":[[2014,9,22]],"date-time":"2014-09-22T05:16:50Z","timestamp":1411363010000},"page":"1637-1648","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences"],"prefix":"10.1007","volume":"31","author":[{"given":"Mustafa","family":"Mohamad","sequence":"first","affiliation":[]},{"given":"David","family":"Rappaport","sequence":"additional","affiliation":[]},{"given":"Godfried","family":"Toussaint","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,23]]},"reference":[{"issue":"2","key":"1467_CR1","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1089\/10665270360688084","volume":"10","author":"A Ben-Dor","year":"2003","unstructured":"Ben-Dor, A., Karp, R.M., Schwikowski, B., Shamir, R.: The restriction scaffold problem. J. Comput. Biol. 10(2), 385\u2013398 (2003)","journal-title":"J. Comput. Biol."},{"key":"1467_CR2","unstructured":"Buss, S.R., Yianilos, P.N.: A bipartite matching approach to approximate string comparison and search. Technical Report, NEC Research Institute (1995)"},{"issue":"4","key":"1467_CR3","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1089\/cmb.2006.13.979","volume":"13","author":"J Colannino","year":"2006","unstructured":"Colannino, J., Damian, M., Hurtado, F., Iacono, J., Meijer, H., Ramaswami, S., Toussaint, G.: An O $$(n \\log n)$$ ( n log n ) time algorithm for the restriction scaffold assignment problem. J. Comput. Biol. 13(4), 979\u2013989 (2006)","journal-title":"J. Comput. Biol."},{"key":"1467_CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s00373-007-0714-3","volume":"23","author":"J Colannino","year":"2007","unstructured":"Colannino, J., Damian, M., Hurtado, F., Langerman, S., Meijer, H., Ramaswami, S., Souvaine, D., Toussaint, G.: Efficient many-to-many point matching in one dimension. Graphs Comb. 23, 169\u2013178 (2007)","journal-title":"Graphs Comb."},{"issue":"2","key":"1467_CR5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s11263-006-6993-y","volume":"69","author":"MF Demirci","year":"2006","unstructured":"Demirci, M.F., Shokoufandeh, A., Keselman, Y., Bretzner, L., Dickinson, S.: Object recognition as many-to-many feature matching. Int. J. Comput. Vis. 69(2), 203\u2013222 (2006)","journal-title":"Int. J. Comput. Vis."},{"issue":"2","key":"1467_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s002360050075","volume":"34","author":"T Eiter","year":"1997","unstructured":"Eiter, T., Mannila, H.: Distance measures for point sets and their computation. Acta Inform. 34(2), 109\u2013133 (1997)","journal-title":"Acta Inform."},{"key":"1467_CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(75)90014-X","volume":"13","author":"RM Karp","year":"1975","unstructured":"Karp, R.M., Li, S.-Y.R.: Two special cases of the assignment problem. Discret. Math. 13, 129\u2013142 (1975)","journal-title":"Discret. Math."},{"key":"1467_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. 2, 83\u201397 (1955)","journal-title":"Nav. Res. Logist."},{"key":"1467_CR9","doi-asserted-by":"crossref","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings via Gaussian elimination. In: Proceedings of 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 248\u2013255 (2004)","DOI":"10.1109\/FOCS.2004.40"},{"key":"1467_CR10","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"1467_CR11","unstructured":"Toussaint, G.: A comparison of rhythmic similarity measures. In: Proceedings of the 5th International Conference on Music Information Retrieval, pp. 242\u2013245 (2004)"},{"key":"1467_CR12","doi-asserted-by":"crossref","unstructured":"Toussaint, G.: The geometry of musical rhythm. In: Akiyama, J., et al. (eds.) Selected Papers of the Japanese Conference on Discrete and Computational Geometry. LNCS, vol. 3742, pp. 198\u2013212. Springer, Berlin (2005)","DOI":"10.1007\/11589440_20"},{"issue":"5783","key":"1467_CR13","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1126\/science.1126287","volume":"313","author":"D Tymoczko","year":"2006","unstructured":"Tymoczko, D.: The geometry of musical chords. Science 313(5783), 72\u201374 (2006)","journal-title":"Science"},{"key":"1467_CR14","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0196-6774(86)90009-X","volume":"7","author":"M Werman","year":"1986","unstructured":"Werman, M., Peleg, S., Melter, R., Kong, T.Y.: Bipartite graph matching for points on a line or a circle. J. Algorithms 7, 277\u2013284 (1986)","journal-title":"J. Algorithms"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1467-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1467-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1467-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:38Z","timestamp":1559055578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1467-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,23]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1467"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1467-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,23]]}}}