{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:12:00Z","timestamp":1725495120081},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429852"},{"type":"electronic","value":"9783540456780"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-45678-3_61","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T16:12:14Z","timestamp":1195143134000},"page":"719-730","source":"Crossref","is-referenced-by-count":7,"title":["Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works"],"prefix":"10.1007","author":[{"given":"Hideaki","family":"Hori","sequence":"first","affiliation":[]},{"given":"Shinichi","family":"Shimozono","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,4]]},"reference":[{"key":"61_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"D. Angluin. Finding patterns common to a set of strings. J. Comput. Sys. Sci., 21:46\u201362, 1980.","journal-title":"J. Comput. Sys. Sci."},{"issue":"2","key":"61_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75(2):87\u2013106, 1987.","journal-title":"Information and Computation"},{"issue":"4","key":"61_CR3","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. Queries and concept learning. Machine Learning, 2(4):319\u2013342, 1988.","journal-title":"Machine Learning"},{"key":"61_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G. Ausiello","year":"1999","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer-Verlag, Berlin, 1999."},{"key":"61_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(94)00291-P","volume":"150","author":"G. Ausiello","year":"1995","unstructured":"G. Ausiello, P. Crescenzi, and M. Protasi. Approximate solution of NP optimization problems. Theor. Comput. Sci., 150: 1\u201355, 1995.","journal-title":"Theor. Comput. Sci."},{"key":"61_CR6","unstructured":"A. Z. Broder. On the resemblance and containment of documents. In Proc. Compression and Complexity of Sequences (SEQUENCES\u201997), pages 21\u201329, 1997."},{"key":"61_CR7","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, New York, 1994."},{"key":"61_CR8","volume-title":"Computers and Intractability","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. W. H. Freeman & Co., New York, 1979."},{"key":"61_CR9","doi-asserted-by":"crossref","unstructured":"G. Das, R. Fleischer, L. Gasieniec, D. Gunopulos, and J. Karkkainen. Episode Matching. In Proc. 8th Annual Symposium on Combinatorial Pattern Matching (CPM\u201997), pages 12\u201327, 1997.","DOI":"10.1007\/3-540-63220-4_46"},{"key":"61_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York, 1997."},{"key":"61_CR11","doi-asserted-by":"crossref","unstructured":"T. Kadota, M. Hirao, A. Ishino, M. Takeda, A. Shinohara, and F. Matsuo. Musical sequence comparison for melodic and rhythmic similarities. In Proc. 8th International Symposium on String Processing and Information Retrieval (SPIRE2001), 2001, to appear.","DOI":"10.1109\/SPIRE.2001.989744"},{"issue":"1","key":"61_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF03037568","volume":"18","author":"S. Shimozono","year":"2000","unstructured":"S. Shimozono, H. Arimura, and S. Arikawa. Efficient discovery of optimal wordassociation patterns in large databases. New Gener. Comput., 18(1):49\u201360, 2000.","journal-title":"New Gener. Comput"},{"key":"61_CR13","unstructured":"M. Takeda, T. Fukuda, I. Nanri, M. Yamasaki, and K. Tamari. Discovering instances of poetic allusion from anthologies of classical Japanese poems. Theor. Comput. Sci., 2001, to appear."},{"key":"61_CR14","doi-asserted-by":"crossref","unstructured":"K. Yamamoto, M. Takeda, A. Shinohara, T. Fukuda, and I. Nanri. Discovering repetitive expressions and affinities from anthologies of classical Japanese poems. In Proc. 4th International Conference on Discovery Science (DS2001), 2001, to appear.","DOI":"10.1007\/3-540-45650-3_35"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45678-3_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T15:10:13Z","timestamp":1551107413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45678-3_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429852","9783540456780"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45678-3_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}