{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:05:12Z","timestamp":1725573912628},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205906"},{"type":"electronic","value":"9783540245865"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24586-5_39","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T00:09:21Z","timestamp":1294358961000},"page":"322-328","source":"Crossref","is-referenced-by-count":7,"title":["Approximate Nearest Neighbour Search with the Fukunaga and Narendra Algorithm and Its Application to Chromosome Classification"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Moreno-Seco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Mic\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Oncina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM\u00a045, 891\u2013923 (1998)","journal-title":"Journal of the ACM"},{"key":"39_CR2","unstructured":"Brin, S.: Near Neighbor Search in Large Metric Spaces. In: Proceedings of the 21st VLDB Conference, pp. 574\u2013584 (1995)"},{"key":"39_CR3","volume-title":"Pattern Classification and Scene Analysis","author":"R. Duda","year":"1973","unstructured":"Duda, R., Hart, P.: Pattern Classification and Scene Analysis. Wiley, Chichester (1973)"},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J.H. Friedman","year":"1977","unstructured":"Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software\u00a03, 209\u2013226 (1977)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/T-C.1975.224297","volume":"24","author":"K. Fukunaga","year":"1975","unstructured":"Fukunaga, K., Narendra, M.: A branch and bound algorithm for computing k\u2013 nearest neighbors. IEEE Trans. Computing\u00a024, 750\u2013753 (1975)","journal-title":"IEEE Trans. Computing"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1002\/cyto.990110105","volume":"11","author":"E. Granum","year":"1990","unstructured":"Granum, E., Thomason, M.G.: Automatically inferred Markov network models for classification of chromosomal band pattern structures. Cytometry\u00a011, 26\u201339 (1990)","journal-title":"Cytometry"},{"key":"39_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/978-3-642-74738-0_18","volume-title":"Automation of Cytogenetics","author":"E. Granum","year":"1989","unstructured":"Granum, E., Thomason, M.G., Gregor, J.: On the use of automatically inferred Markov networks for chromosome analysis. In: Lundsteen, C., Piper, J. (eds.) Automation of Cytogenetics, pp. 233\u2013251. Springer, Heidelberg (1989)"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1111\/j.1399-0004.1980.tb02296.x","volume":"18","author":"C. Lundsteen","year":"1980","unstructured":"Lundsteen, C., Phillip, J., Granum, E.: Quantitative analysis of 6985 digitized trypsin G-banded human metaphase chromosomes. Clinical Genetics\u00a018, 355\u2013370 (1980)","journal-title":"Clinical Genetics"},{"key":"39_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-540-44871-6_69","volume-title":"Pattern Recognition and Image Analysis","author":"F. Moreno-Seco","year":"2003","unstructured":"Moreno-Seco, F., Mic\u00f3, L., Oncina, J.: Extending fast nearest neighbour search algorithms for approximate k-NN classification. In: Perales, F.J., Campilho, A.C., P\u00e9rez, N., Sanfeliu, A. (eds.) IbPRIA 2003. LNCS, vol.\u00a02652, pp. 589\u2013597. Springer, Heidelberg (2003)"},{"issue":"9","key":"39_CR10","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1109\/34.615448","volume":"19","author":"S. Nene","year":"1997","unstructured":"Nene, S., Nayar, S.: A Simple Algorithm for Nearest Neighbor Search in High Dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a019(9), 989\u20131003 (1997)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8655(94)90094-9","volume":"15","author":"E. Vidal","year":"1994","unstructured":"Vidal, E.: New formulation and improvements of the Nearest-Neighbour Approximating and Eliminating Search Algorithm (AESA). Pattern Recognition Letters\u00a015, 1\u20137 (1994)","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"39_CR12","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The String-to-String Correction Problem. Journal of the Association for Computing Machinery\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"39_CR13","unstructured":"Yianilos, P.N.: Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 311\u2013321 (1993)"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Speech and Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24586-5_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T04:24:01Z","timestamp":1553315041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24586-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205906","9783540245865"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24586-5_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}