{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T02:41:18Z","timestamp":1776220878646,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T00:00:00Z","timestamp":1450656000000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10878-015-9979-2","type":"journal-article","created":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T00:47:03Z","timestamp":1450658823000},"page":"551-566","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A heuristic for the time constrained asymmetric linear sum assignment problem"],"prefix":"10.1007","volume":"33","author":[{"given":"Peter","family":"Brown","sequence":"first","affiliation":[]},{"given":"Yuedong","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yaoqi","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Wayne","family":"Pullan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,21]]},"reference":[{"issue":"1","key":"9979_CR1","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02186476","volume":"14","author":"D Bertsekas","year":"1988","unstructured":"Bertsekas D (1988) The auction algorithm; a distributed relaxation method for the assignment problem. Ann Oper Res 14(1):105\u2013123","journal-title":"Ann Oper Res"},{"key":"9979_CR2","unstructured":"Brown P, Pullan W, Yang Y, Zhou Y (2015) Fast and accurate non-sequential protein structure alignment using a new asymmetric linear sum assignment heuristic. Bioinformatics, btv580"},{"key":"9979_CR3","doi-asserted-by":"crossref","unstructured":"Burkard R, Dell\u2019Amico M, Martello S (2012) Assignment problems. Philadelphia: Society for Industrial and Applied Mathematics, revised reprint edition","DOI":"10.1137\/1.9781611972238"},{"issue":"3","key":"9979_CR4","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s10589-007-9146-5","volume":"43","author":"L Bus\u0306","year":"2009","unstructured":"Bus\u0306 L, Tvrdik\u0301 P (2009) Towards auction algorithms for large dense assignment problems. Comput Optim Appl 43(3):411\u2013436","journal-title":"Comput Optim Appl"},{"key":"9979_CR5","doi-asserted-by":"crossref","unstructured":"Cheng Y, Wu V, Collins R, Hanson A, Riseman ET (1996) Maximum-weight bipartite matching technique and its application in image feature matching. In: SPIE conference on visual communication and image processing, pp 1358\u20131379","DOI":"10.1117\/12.233261"},{"issue":"2","key":"9979_CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1012424014764","volume":"45","author":"Y Cheng","year":"2001","unstructured":"Cheng Y, Wang X, Collins R, Riseman E, Hanson A (2001) Three-dimensional reconstruction of points and lines with unknown correspondence across images. Int J Comput Vis 45(2):129\u2013156","journal-title":"Int J Comput Vis"},{"issue":"3","key":"9979_CR7","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/j.jmb.2011.02.056","volume":"408","author":"L Dai","year":"2011","unstructured":"Dai L, Zhou Y (2011) Characterizing the existing and potential structural space of proteins by large-scale multiple loop permutations. J Mol Biol 408(3):585\u2013595","journal-title":"J Mol Biol"},{"issue":"6","key":"9979_CR8","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1093\/bioinformatics\/btt618","volume":"30","author":"F Guyon","year":"2014","unstructured":"Guyon F, Tuffery P (2014) Fast protein fragment similarity scoring using a binet-cauchy kernel. Bioinformatics 30(6):784\u2013791","journal-title":"Bioinformatics"},{"issue":"10","key":"9979_CR9","doi-asserted-by":"crossref","first-page":"2463","DOI":"10.1093\/bioinformatics\/bti373","volume":"21","author":"D Konovalov","year":"2005","unstructured":"Konovalov D, Litow B, Bajema N (2005) Partition-distance via the assignment problem. Bioinformatics 21(10):2463\u20132468","journal-title":"Bioinformatics"},{"issue":"1\u20132","key":"9979_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The hungarian method for the assignment problem. Naval Res Log Quar 2(1\u20132):83\u201397","journal-title":"Naval Res Log Quar"},{"issue":"2","key":"9979_CR11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe DG (2004) Distinctive image features from scale-invariant keypoints. Int J Comp Vis 60(2):91\u2013110","journal-title":"Int J Comp Vis"},{"key":"9979_CR12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.4137\/CIN.S4744","volume":"9","author":"T Milenkovi\u0107","year":"2010","unstructured":"Milenkovi\u0107 T, Ng WL, Hayes W, Pr\u017eulj N (2010) Optimal network alignment with graphlet degree vectors. Cancer Inf 9:121","journal-title":"Cancer Inf"},{"key":"9979_CR13","doi-asserted-by":"crossref","unstructured":"Naiem A, El-Beltagy M (2013) On the optimality and speed of the deep greedy switching algorithm for linear assignment problems. In: IEEE 27th international symposium on parallel and distributed processing symposium workshops & PhD forum (IPDPSW), pp 1828\u20131837","DOI":"10.1109\/IPDPSW.2013.54"},{"key":"9979_CR14","first-page":"431","volume":"12","author":"K Ramakrishnan","year":"1993","unstructured":"Ramakrishnan K, Karmarkar N, Kamath A (1993) An approximate dual projective algorithm for solving assignment problems. Netw. Flows Matching 12:431\u2013451","journal-title":"Netw. Flows Matching"},{"issue":"3","key":"9979_CR15","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.1040.0189","volume":"53","author":"DM Strickland","year":"2005","unstructured":"Strickland DM, Barnes E, Sokol JS (2005) Optimal protein structure alignment using maximum cliques. Oper Res 53(3):389\u2013402","journal-title":"Oper Res"},{"key":"9979_CR16","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1002\/prot.24100","volume":"80","author":"Y Yang","year":"2012","unstructured":"Yang Y, Zhan J, Zhao H, Zhou Y (2012) A new size-independent score for pairwise protein structure alignment and its application to structure classification and nucleic-acid binding prediction. Proteins 80:2080\u20132088","journal-title":"Proteins"},{"issue":"12","key":"9979_CR17","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1093\/bioinformatics\/btp196","volume":"25","author":"M Zaslavskiy","year":"2009","unstructured":"Zaslavskiy M, Bach F, Vert J-P (2009) Global alignment of protein-protein interaction networks by graph matching methods. Bioinformatics 25(12):1259\u20131267","journal-title":"Bioinformatics"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9979-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9979-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9979-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9979-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T07:07:47Z","timestamp":1718262467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9979-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,21]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9979"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9979-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,21]]}}}