{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:41Z","timestamp":1725492401074},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403913"},{"type":"electronic","value":"9783540449775"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_32","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:20:28Z","timestamp":1192530028000},"page":"295-300","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Programming \u2014 NFA Simulation"],"prefix":"10.1007","author":[{"given":"Jan","family":"Holub","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"32_CR1","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"A faster algorithm for approximate string matching","author":"R. A. Baeza-Yates","year":"1996","unstructured":"R. A. Baeza-Yates and G. Navarro. A faster algorithm for approximate string matching. In Proceedings of the CPM\u201996, no. 1075 in LNCS, pages 1\u201323, Laguna Beach, CA, 1996. Springer-Verlag, Berlin."},{"key":"32_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/BFb0035772","volume-title":"An improved algorithm for approximate string matching","author":"Z. Galil","year":"1989","unstructured":"Z. Galil and K. Park. An improved algorithm for approximate string matching. In Proceedings of the 16th ICALP, no. 372 in LNCS, pages 394\u2013404, Stresa, Italy, 1989. Springer-Verlag, Berlin."},{"key":"32_CR3","unstructured":"J. Holub. Approximate string matching in text. Master\u2019s thesis, Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic, 1996."},{"key":"32_CR4","unstructured":"J. Holub. Simulation of NFA in approximate string and sequence matching. In Proceedings of the Prague Stringology Club Workshop\u2019 97, pages 39\u201346, Czech Technical University, Prague, Czech Republic, 1997."},{"key":"32_CR5","unstructured":"J. Holub. Dynamic programming for reduced NFAs for approximate string and sequence matching. In Proceedings of the Prague Stringology Club Workshop\u2019 98, pages 73\u201382, Czech Technical University, Prague, Czech Republic, 1998."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"J. Holub. Simulation of Nondeterministic Finite Automata in Pattern Matching. Ph.D. Thesis, Czech Technical University, Prague, Czech Republic, 2000.","DOI":"10.1007\/3-540-48057-9_8"},{"key":"32_CR7","unstructured":"J. Holub. Bit parallelism-NFA simulation. In Proceedings of the 6th CIAA, Pretoria, South Africa, 2001. University of Pretoria."},{"key":"32_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/3-540-48057-9_8","volume-title":"Implementation of nondeterministic finite automata for approximate pattern matching","author":"J. Holub","year":"1999","unstructured":"J. Holub and B. Melichar. Implementation of nondeterministic finite automata for approximate pattern matching. In Proceedings of the WIA\u201998, no. 1660 in LNCS, pages 92\u201399, Rouen, France, 1999. Springer-Verlag, Berlin."},{"key":"32_CR9","unstructured":"J. E. Hopcroft and J. D. Ullman. Introduction to automata, languages and computations. Addison-Wesley, Reading, MA, 1979."},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"D. C. Kozen. Automata and Computability. Springer-Verlag, Berlin, 1997.","DOI":"10.1007\/978-1-4612-1844-9"},{"key":"32_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/3-540-60268-2_315","volume-title":"Computer Analysis of Images and Patterns","author":"B. Melichar","year":"1995","unstructured":"B. Melichar. Approximate string matching by finite automata. In Computer Analysis of Images and Patterns, no. 970 in LNCS, pages 342\u2013349. Springer-Verlag, Berlin, 1995."},{"issue":"4","key":"32_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P. H. Sellers","year":"1980","unstructured":"P. H. Sellers. The theory and computation of evolutionary distances: Pattern recognition. J. Algorithms, 1(4):359\u2013373, 1980.","journal-title":"J. Algorithms"},{"issue":"1\u20133","key":"32_CR13","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E. Ukkonen","year":"1985","unstructured":"E. Ukkonen. Finding approximate patterns in strings. J. Algorithms, 6(1\u20133):132\u2013137, 1985.","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44977-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T16:23:28Z","timestamp":1556900608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}