{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:59:11Z","timestamp":1725566351400},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233572"},{"type":"electronic","value":"9783540302148"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30214-8_21","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T19:19:01Z","timestamp":1285096741000},"page":"270-277","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Discovery of Subword Associations in Strings"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cinzia","family":"Pizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Satta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. ACM SIGMOD, Washington DC, May 1993, pp. 207\u2013216 (1993)","key":"21_CR1","DOI":"10.1145\/170035.170072"},{"key":"21_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"volume-title":"Pattern Matching Algorithms","year":"1997","unstructured":"Apostolico, A., Galil, Z. (eds.): Pattern Matching Algorithms. Oxford University Press, New York (1997)","key":"21_CR3"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF03037568","volume":"18","author":"H. Arimura","year":"2000","unstructured":"Arimura, H., Arikawa, S.: Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases. New Generation Computing\u00a018, 49\u201360 (2000)","journal-title":"New Generation Computing"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D., Chen, M.T., Seiferas, J.: The Smallest Automaton Recognizing the Subwords of a Text. Theoretical Computer Science\u00a040, 31\u201355 (1985)","journal-title":"Theoretical Computer Science"},{"unstructured":"Brill, E.: Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part of Speech Tagging, Computational Linguistics (1995)","key":"21_CR6"},{"key":"21_CR7","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, New York (1994)"},{"key":"21_CR8","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2000","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, San Francisco (2000)"},{"doi-asserted-by":"crossref","unstructured":"Karlsson, F., Voutilainen, A., Heikkil\u00e4, F., Anttila, A.: Constraint Grammar. A Language Independent System for Parsing Unrestricted Text. Mouton de Gruyter (1995)","key":"21_CR9","DOI":"10.1515\/9783110882629"},{"key":"21_CR10","volume-title":"Foundations of Statistical Natural Language Processing","author":"C.D. Manning","year":"1999","unstructured":"Manning, C.D., Sch\u00fctze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (1999)"},{"issue":"2","key":"21_CR11","first-page":"313","volume":"19","author":"M.P. Marcus","year":"1993","unstructured":"Marcus, M.P., Santorini, B., Marcinkiewicz, M.A.: Building a Large Annotated Corpus of English: The Penn Treebank. Computational Linguistics\u00a019(2), 313\u2013330 (1993)","journal-title":"Computational Linguistics"},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A Space-Economical Suffix Tree Construction Algorithm. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"issue":"1-3","key":"21_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0304-3975(03)00053-7","volume":"304","author":"J.C. Na","year":"2003","unstructured":"Na, J.C., Apostolico, A., Iliopoulos, C.S., Park, K.: Truncated Suffix Trees and their Application to Data Compression. Theoretical Computer Science\u00a0304(1-3), 87\u2013101 (2003)","journal-title":"Theoretical Computer Science"},{"unstructured":"Piatesky-Shapiro, G., Frawley, W.J. (eds.): Knowledge Discovery in Databases. AAAI Press\/MIT Press (1991)","key":"21_CR14"},{"key":"21_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: Simplifications and Parallelizations. SIAM Journal on Computing\u00a017, 1253\u20131262 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line Construction of Suffix Trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"issue":"8","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1808","DOI":"10.1093\/nar\/28.8.1808","volume":"28","author":"J. Helden van","year":"2000","unstructured":"van Helden, J., Rios, A.F., Collado-Vides, J.: Discovering Regulatory Elements in Non-coding Sequences by Analysis of Spaced Dyads. Nucleic Acid Research\u00a028(8), 1808\u20131818 (2000)","journal-title":"Nucleic Acid Research"},{"doi-asserted-by":"crossref","unstructured":"Wang, J.T.-L., Chirn, G.-W., Marr, T.G., Shapiro, B., Shasha, D., Zhang, K.: Combinatorial Pattern Discovery for Scientific Data: Some Preliminary Results. In: Proceedings of 1994 SIGMOD, pp. 115\u2013125 (1994)","key":"21_CR18","DOI":"10.1145\/191843.191863"},{"doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear Pattern Matching algorithm. In: Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, Washington, DC, pp. 1\u201311 (1973)","key":"21_CR19","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30214-8_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:49:45Z","timestamp":1605761385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30214-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233572","9783540302148"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30214-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}