{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:19:02Z","timestamp":1725567542981},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163203"},{"type":"electronic","value":"9783642163210"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16321-0_11","type":"book-chapter","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T10:51:32Z","timestamp":1286275892000},"page":"118-126","source":"Crossref","is-referenced-by-count":0,"title":["A PTAS for the Square Tiling Problem"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Apostolico","sequence":"additional","affiliation":[]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[]},{"given":"Oren Sar","family":"Shalom","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5-6","key":"11_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/S1570-8667(03)00035-2","volume":"1","author":"A. Amir","year":"2003","unstructured":"Amir, A., Apostolico, A., Landau, G.M., Satta, G.: Efficient text fingerprinting via Parikh mapping. J. of Discrete Algorithms\u00a01(5-6), 409\u2013421 (2003)","journal-title":"J. of Discrete Algorithms"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-642-03784-9_25","volume-title":"SPIRE 2009","author":"A. Amir","year":"2009","unstructured":"Amir, A., Parienty, H.: Towards a theory of patches. In: Karlgren, J., Tarhio, J., Hyyr\u00f6, H. (eds.) SPIRE 2009. LNCS, vol.\u00a05721, pp. 254\u2013265. Springer, Heidelberg (2009)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-45784-4_36","volume-title":"Algorithms in Bioinformatics","author":"A. Bergeron","year":"2002","unstructured":"Bergeron, A., Corteel, S., Raffinot, M.: The algorithmic of gene teams. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 464\u2013476. Springer, Heidelberg (2002)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Epshtein, B., Ullman, S.: Identifying semantically equivalent object fragments. In: Proc. IEEE Conference on Computer vision and Pattern Recognition (CVPR), vol.\u00a01, pp. 2\u20139 (2005)","DOI":"10.1109\/CVPR.2005.180"},{"issue":"6","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1089\/cmb.2004.11.1050","volume":"11","author":"R. Eres","year":"2004","unstructured":"Eres, R., Landau, G.M., Parida, L.: Permutation pattern discovery in biosequences. Journal of Computational Biology\u00a011(6), 1050\u20131060 (2004)","journal-title":"Journal of Computational Biology"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"He, X., Goldwasser, M.H.: Identifying conserved gene clusters in the presence of orthologous groups. In: Proc. 8th Annual International Conferences on Research in Computational Molecular Biology (RECOMB), pp. 272\u2013280 (2004)","DOI":"10.1145\/974614.974650"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-48194-X_19","volume-title":"Combinatorial Pattern Matching","author":"S. Heber","year":"2001","unstructured":"Heber, S., Stoye, J.: Finding all common intervals of k permutations. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 207\u2013218. Springer, Heidelberg (2001)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Karlsson, F., Voutilainen, A., Heikkil\u00e4, J., Anttila, A.: Constraint Grammar. A Language Independent System for Parsing Unrestricted Text. Mouton de Gruyter (1995)","DOI":"10.1515\/9783110882629"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1023\/A:1012491016871","volume":"15","author":"G. Lu","year":"2001","unstructured":"Lu, G.: Indexing and retrieval of audio: A survey. Multimedia Tools and Applications\u00a015(3), 269\u2013290 (2001)","journal-title":"Multimedia Tools and Applications"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/moor.9.2.244","volume":"9","author":"M.J. Magazine","year":"1984","unstructured":"Magazine, M.J., Chern, M.-S.: A note on approximation schemes for multidimensional knapsack problems. Mathematics of Operations Research\u00a09(2), 244\u2013247 (1984)","journal-title":"Mathematics of Operations Research"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-45129-3_7","volume-title":"Visual Form 2001","author":"M. Vidal-Naquet","year":"2001","unstructured":"Vidal-Naquet, M., Ullman, S., Sali, E.: A fragment-based approach to object representation and classification. In: Arcelli, C., Cordella, L.P., Sanniti di Baja, G. (eds.) IWVF 2001. LNCS, vol.\u00a02059, pp. 85\u2013102. Springer, Heidelberg (2001)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-27801-6_26","volume-title":"Combinatorial Pattern Matching","author":"T. Schmidt","year":"2004","unstructured":"Schmidt, T., Stoye, J.: Quadratic time algorithms for finding common intervals in two and more sequences. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 347\u2013358. Springer, Heidelberg (2004)"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"138","DOI":"10.3844\/jcssp.2007.138.143","volume":"3","author":"C. Srisuwannapa","year":"2007","unstructured":"Srisuwannapa, C., Chamsethikul, P.: An exact algorithm for the unbounded knapsack problem with minimizing maximum processing time. J. of Computer Science\u00a03(3), 138\u2013143 (2007)","journal-title":"J. of Computer Science"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Stricker, M., Swain, M.: The capacity of color histogram indexing. In: Proc. IEEE Conference on Computer vision and Pattern Recognition (CVPR), pp. 704\u2013708 (1994)","DOI":"10.1109\/CVPR.1994.323774"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s004539910014","volume":"26","author":"T. Uno","year":"2000","unstructured":"Uno, T., Yagiura, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica\u00a026(2), 290\u2013309 (2000)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16321-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T03:13:34Z","timestamp":1559704414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16321-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163203","9783642163210"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16321-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}