{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:08Z","timestamp":1725564968348},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_28","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:01:28Z","timestamp":1283727688000},"page":"249-258","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for Point Set Matching with k-Differences"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0020-0190(95)00111-O","volume":"55","author":"T. Akutsu","year":"1995","unstructured":"Akutsu, T.: Approximate String Matching with Don\u2019t Care Characters. Information Processing Letters\u00a055, 235\u2013239 (1995)","journal-title":"Information Processing Letters"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0925-7721(97)00010-2","volume":"9","author":"T. Akutsu","year":"1998","unstructured":"Akutsu, T.: On Determining the Congruence of Point Sets in d Dimensions. Computational Geometry, Theory and Applications\u00a09, 247\u2013256 (1998)","journal-title":"Computational Geometry, Theory and Applications"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/PL00009388","volume":"20","author":"T. Akutsu","year":"1998","unstructured":"Akutsu, T., Tamaki, H., Tokuyama, T.: Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. Discrete and Computational Geometry\u00a020, 307\u2013331 (1998)","journal-title":"Discrete and Computational Geometry"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF02187910","volume":"3","author":"H. Alt","year":"1988","unstructured":"Alt, H., Melhorn, K., Wagener, H., Welzl, E.: Congruence, Similarity, and Symmetrics of Geometric Objects. Discrete and Computational Geometry\u00a03, 237\u2013256 (1988)","journal-title":"Discrete and Computational Geometry"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1995.1047","volume":"118","author":"A. Amir","year":"1995","unstructured":"Amir, A., Farach, M.: Efficient 2-Dimensional Approximate Matching of Half- Rectangular Figures. Information and Computation\u00a0118, 1\u201311 (1995)","journal-title":"Information and Computation"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0196-6774(87)90036-8","volume":"8","author":"M.D. Atkinson","year":"1987","unstructured":"Atkinson, M.D.: An Optimal Algorithm for Geometrical Congruence. J. Algorithms\u00a08, 159\u2013172 (1987)","journal-title":"J. Algorithms"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Cardoze, D.E., Schulman, L.J.: Pattern Matching for Spatial Point Sets. In: Proc. 38th Symp. Foundations of Computer Science, pp. 156\u2013165 (1998)","DOI":"10.1109\/SFCS.1998.743439"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF02187783","volume":"5","author":"K. Clarkson","year":"1990","unstructured":"Clarkson, K., Edelsbrunner, H., Guibas, L., Sharir, M., Welzl, E.: Combinatorial Complexity Bounds for Arrangements of Curves and Spheres. Discrete and Computational Geometry\u00a05, 99\u2013160 (1990)","journal-title":"Discrete and Computational Geometry"},{"key":"28_CR9","doi-asserted-by":"publisher","DOI":"10.1142\/9789812778222","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0190(86)90097-9","volume":"18","author":"P.T. Highnam","year":"1986","unstructured":"Highnam, P.T.: Optimal Algorithms for Finding the Symmetries of a Planar Point Set. Information Processing Letters\u00a018, 219\u2013222 (1986)","journal-title":"Information Processing Letters"},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0925-7721(02)00095-0","volume":"24","author":"P. Indyk","year":"2003","unstructured":"Indyk, P., Venketasubramanian, S.: Approximate Congruence in Nearly Linear Time. Computational Geometry, Theory and Applications\u00a024, 115\u2013128 (2003)","journal-title":"Computational Geometry, Theory and Applications"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G.M. Landau","year":"1989","unstructured":"Landau, G.M., Vishkin, U.: Fast Parallel and Serial Approximate String Matching. J. Algorithms\u00a010, 157\u2013169 (1989)","journal-title":"J. Algorithms"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/0020-0190(76)90092-2","volume":"5","author":"G. Manacher","year":"1976","unstructured":"Manacher, G.: An Application of Pattern Matching to a Problem in Geometrical Complexity. Information Processing Letters\u00a05, 6\u20137 (1976)","journal-title":"Information Processing Letters"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCright","year":"1976","unstructured":"McCright, E.M.: A Space-Economical Suffix Tree Construction Algorithm. J. ACM\u00a023, 262\u2013272 (1976)","journal-title":"J. ACM"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM J. Computing\u00a017, 1253\u20131262 (1988)","journal-title":"SIAM J. Computing"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1017\/S0963548397002976","volume":"6","author":"L. Sz\u00e9kely","year":"1997","unstructured":"Sz\u00e9kely, L.: Crossing Numbers and Hard Erd\u00f6s Problems in Discrete Geometry. Combinatorics, Probability and Computing\u00a06, 353\u2013358 (1997)","journal-title":"Combinatorics, Probability and Computing"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02579194","volume":"3","author":"E. Szemer\u00e9di","year":"1983","unstructured":"Szemer\u00e9di, E., Trotter, W.T.: Extremal Problems in Discrete Geometry. Combinatorica\u00a03, 381\u2013392 (1983)","journal-title":"Combinatorica"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"2907","DOI":"10.1073\/pnas.96.6.2907","volume":"96","author":"P. Tamayo","year":"1999","unstructured":"Tamayo, P., Slonim, D., Mesirov, J., Zhu, Q., Kitareewan, A., Dmitrovsky, E., Lander, E.S., Golub, T.R.: Interpreting Patterns of Gene Expression with Self- Organizing Maps: Methods and Application to Hematopoietic Differentiation. Proc. Natl. Acad. Sci. USA\u00a096, 2907\u20132912 (1999)","journal-title":"Proc. Natl. Acad. Sci. USA"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:34Z","timestamp":1620012394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}