{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:30:50Z","timestamp":1743150650205,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540896883"},{"type":"electronic","value":"9783540896890"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89689-0_34","type":"book-chapter","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T07:32:14Z","timestamp":1228116734000},"page":"298-307","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Genetic Algorithm and Procrustes Analysis for Enhancing the Matching of Graphs Generated from Shapes"],"prefix":"10.1007","author":[{"given":"Gerard","family":"Sanrom\u00e0","sequence":"first","affiliation":[]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[]},{"given":"Ren\u00e9","family":"Alqu\u00e9zar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Luo, B., Hancock, E.R.: Structural graph matching using the em algorithm and singular value decomposition. Pattern Analysis and Machine Intelligence\u00a023(10) (October 2001)","DOI":"10.1109\/34.954602"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Wilson, R.C., Hancock, E.R.: Structural matching by discrete relaxation. Pattern Analysis and Machine Intelligence 19(6) (June 1997)","DOI":"10.1109\/34.601251"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. Pattern Analysis and Machine Intelligence\u00a018(4) (April 1996)","DOI":"10.1109\/34.491619"},{"key":"34_CR4","volume-title":"Statistical Shape Analysis","author":"I.L. Dryden","year":"1998","unstructured":"Dryden, I.L., Mardia, K.V.: Statistical Shape Analysis. John Wiley and Sons, Chichester (1998)"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Whitley, D., Beveridge, R., Graves, C., Mathias, K.: Test driving three 1995 genetic algorithms: New test functions and geometric matching. J. Heurist\u00a01 (June 1995)","DOI":"10.1007\/BF02430367"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Cross, A.D.J., Wilson, R.C., Hancock, E.R.: Inexact graph matching using genetic search. Pattern Recognition\u00a030(6) (1997)","DOI":"10.1016\/S0031-3203(96)00123-9"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Myers, R., Hancock, E.R.: Least-commitment graph matching with genetic algorithms. Pattern recognition\u00a034 (October 1999)","DOI":"10.1016\/S0031-3203(99)00217-4"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89689-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:58:23Z","timestamp":1557943103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89689-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540896883","9783540896890"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89689-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}