{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:28:58Z","timestamp":1725470938256},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540457749"},{"type":"electronic","value":"9783540457756"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11880561_6","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T12:16:48Z","timestamp":1159445808000},"page":"61-73","source":"Crossref","is-referenced-by-count":3,"title":["Sparse Directed Acyclic Word Graphs"],"prefix":"10.1007","author":[{"given":"Shunsuke","family":"Inenaga","sequence":"first","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern-matching algorithms. In: Proc. of 14th IEEE Ann. Symp. on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"6_CR2","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":"6_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-61332-3_155","volume-title":"Computing and Combinatorics","author":"J. K\u00e4rkk\u00e4nen","year":"1996","unstructured":"K\u00e4rkk\u00e4nen, J., Ukkonen, E.: Sparse suffix trees. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol.\u00a01090, pp. 219\u2013230. Springer, Heidelberg (1996)"},{"key":"6_CR5","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-30219-3_39","volume-title":"Algorithms in Bioinformatics","author":"S. Inenaga","year":"2004","unstructured":"Inenaga, S., Kivioja, T., M\u00e4kinen, V.: Finding missing patterns. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 463\u2013474. Springer, Heidelberg (2004)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1109\/TCBB.2004.36","volume":"1","author":"H. Bannai","year":"2004","unstructured":"Bannai, H., Hyyr\u00f6, H., Shinohara, A., Takeda, M., Nakai, K., Miyano, S.: An O(N\n                           2) algorithm for discovering optimal boolean pattern pairs. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a01, 159\u2013170 (2004)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"6_CR7","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-30214-8_3","volume-title":"Discovery Science","author":"S. Inenaga","year":"2004","unstructured":"Inenaga, S., Bannai, H., Hyyr\u00f6, H., Shinohara, A., Takeda, M., Nakai, K., Miyano, S.: Finding optimal pairs of cooperative and competing patterns with bounded distance. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol.\u00a03245, pp. 32\u201346. Springer, Heidelberg (2004)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BFb0035751","volume-title":"Automata, Languages and Programming","author":"R. Baeza-Yates","year":"1989","unstructured":"Baeza-Yates, R., Gonnet, G.H.: Efficient text searching of regular expressions. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 46\u201362. Springer, Heidelberg (1989)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/PL00009260","volume":"23","author":"A. Andersson","year":"1999","unstructured":"Andersson, A., Larsson, N.J., Swanson, K.: Suffix trees on words. Algorithmica\u00a023, 246\u2013260 (1999)","journal-title":"Algorithmica"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11780441_7","volume-title":"Combinatorial Pattern Matching","author":"S. Inenaga","year":"2006","unstructured":"Inenaga, S., Takeda, M.: On-line linear-time construction of word suffix trees. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 60\u201371. Springer, Heidelberg (2006)"},{"key":"6_CR11","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., Haussler, D., Ehrenfeucht, A., 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"},{"key":"6_CR12","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, 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Blumer, J., Haussler, D., McConnell, R., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. Journal of the ACM\u00a034, 578\u2013595 (1987)","journal-title":"Journal of the ACM"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.dam.2004.04.012","volume":"146","author":"S. Inenaga","year":"2005","unstructured":"Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., Pavesi, G.: On-line construction of compact directed acyclic word graphs. Discrete Applied Mathematics\u00a0146, 156\u2013179 (2005)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11880561_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:27:24Z","timestamp":1619508444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11880561_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540457749","9783540457756"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11880561_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}