{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:15:28Z","timestamp":1748751328906,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49192-8_17","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T15:47:27Z","timestamp":1452181647000},"page":"208-216","source":"Crossref","is-referenced-by-count":0,"title":["Subsequence Automata with Default Transitions"],"prefix":"10.1007","author":[{"given":"Philip","family":"Bille","sequence":"first","affiliation":[]},{"given":"Inge Li","family":"G\u00f8rtz","sequence":"additional","affiliation":[]},{"given":"Frederik Rye","family":"Skjoldjensen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","volume":"78","author":"RA Baeza-Yates","year":"1991","unstructured":"Baeza-Yates, R.A.: Searching subsequences. Theor. Comput. Sci. 78(2), 363\u2013376 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.tcs.2005.03.027","volume":"341","author":"Z Tron\u00ed\u010dek","year":"2005","unstructured":"Tron\u00ed\u010dek, Z., Shinohara, A.: The size of subsequence automaton. Theor. Comput. Sci. 341(1), 379\u2013384 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"3\u20134","key":"17_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S1570-8667(03)00029-7","volume":"1","author":"M Crochemore","year":"2003","unstructured":"Crochemore, M., Melichar, B., Tron\u00ed\u010dek, Z.: Directed acyclic subsequence graph: overview. J. Disc. Algorithms 1(3\u20134), 255\u2013280 (2003)","journal-title":"J. Disc. Algorithms"},{"key":"17_CR4","unstructured":"Crochemore, M., Tron\u00ed\u010dek, Z.: Directed acyclic subsequence graph for multiple texts. Technical repport, Institut Gaspard-Monge, pp. 99\u2013118. Citeseer (1999)"},{"key":"17_CR5","unstructured":"Crochemore, M., Tronicek, Z.: Directed acyclic subsequence graph for multiple texts. Technical Report IGM-99-13, Institut Gaspard-Monge (1999)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S.: Online construction of subsequence automata for multiple texts. In: Proceedings of the 7th SPIRE, pp. 146\u2013152 (2000)","DOI":"10.1109\/SPIRE.2000.878190"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-16321-0_25","volume-title":"String Processing and Information Retrieval","author":"E Farhana","year":"2010","unstructured":"Farhana, E., Ferdous, J., Moosa, T., Rahman, M.S.: Finite automata based algorithms for the generalized constrained longest common subsequence problems. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 243\u2013249. Springer, Heidelberg (2010)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-45138-9_15","volume-title":"Mathematical Foundations of Computer Science 2003","author":"H Bannai","year":"2003","unstructured":"Bannai, H., Inenaga, S., Shinohara, A., Takeda, M.: Inferring strings from graphs and arrays. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 208\u2013217. Springer, Heidelberg (2003)"},{"key":"17_CR9","first-page":"82","volume-title":"Lecture Notes in Computer Science","author":"Zden\u011bk Tron\u00ec\u010dek","year":"1999","unstructured":"Tron\u00ed\u010dek, Z.: Operations on DASG. In: Proceedings of the 4th WIA, pp. 82\u201391 (1999)"},{"key":"17_CR10","unstructured":"Tron\u00ed\u010dek, Z.: Searching subsequences. Department of Computer Science and Engineering, FEE CTU in Prague, Ph.D. thesis (2001)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-44977-9_28","volume-title":"Implementation and Application of Automata","author":"Z Tron\u00ed\u010dek","year":"2003","unstructured":"Tron\u00ed\u010dek, Z.: Common subsequence automaton. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 270\u2013275. Springer, Heidelberg (2003)"},{"issue":"3","key":"17_CR12","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1016\/j.tcs.2008.08.042","volume":"409","author":"Philip Bille","year":"2008","unstructured":"Bille, P., Farach-Colton, M.: Fast and compact regular expression matching. Theoret. Comput. Sci. 409, 486\u2013496 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"17_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"issue":"4","key":"17_CR15","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/1151659.1159952","volume":"36","author":"Sailesh Kumar","year":"2006","unstructured":"Kumar, S., Dharmapurikar, S., Yu, F., Crowley, P., Turner, J.: Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In: Proceedings of the 12th SIGCOMM, pp. 339\u2013350 (2006)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Hayes, Ch.L., Luo, Y.: DPICO: a high speed deep packet inspection engine using compact finite automata. In: Proceedings of the 3rd ANCS, pp. 195\u2013203 (2007)","DOI":"10.1145\/1323548.1323579"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T02:19:16Z","timestamp":1748744356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}