{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T15:31:12Z","timestamp":1648913472523},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,8]]},"abstract":"<jats:p> The largest common point set problem (LCP) is, given two point set P and Q in d-dimensional Euclidean space, to find a subset of P with the maximum cardinality that is congruent to some subset of Q. We consider a special case of LCP in which the size of the largest common point set is at least (|P| + |Q| - k)\/2. We develop efficient algorithms for this special case of LCP and a related problem. In particular, we present an O(k<jats:sup>3<\/jats:sup>n<jats:sup>1.34<\/jats:sup> + kn<jats:sup>2<\/jats:sup> log n) time algorithm for LCP in two-dimensions, which is much better for small k than an existing O(n<jats:sup>3.2<\/jats:sup> log n) time algorithm, where n = max {|P|,|Q|}. <\/jats:p>","DOI":"10.1142\/s0129054106004170","type":"journal-article","created":{"date-parts":[[2006,8,4]],"date-time":"2006-08-04T22:37:04Z","timestamp":1154731024000},"page":"903-917","source":"Crossref","is-referenced-by-count":0,"title":["ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES"],"prefix":"10.1142","volume":"17","author":[{"given":"TATSUYA","family":"AKUTSU","sequence":"first","affiliation":[{"name":"Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji-city, Kyoto 611-0011, Japan"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00111-O"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(97)00010-2"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009388"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187910"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1047"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90036-8"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187783"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700370527"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1142\/9789812778222"},{"key":"rf11","first-page":"219","volume":"18","author":"Highnam P. T.","journal-title":"Information Processing Letters"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(02)00095-0"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90010-2"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90092-2"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1137\/0217079"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548397002976"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579194"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.96.6.2907"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106004170","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:40:32Z","timestamp":1565138432000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":18,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,8]]}},"alternative-id":["10.1142\/S0129054106004170"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106004170","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8]]}}}