{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:33:58Z","timestamp":1725482038401},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646945"},{"type":"electronic","value":"9783540691044"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0031378","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T02:38:17Z","timestamp":1134268697000},"page":"25-28","source":"Crossref","is-referenced-by-count":0,"title":["Visualization of dynamic automata using Padnon"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bertault","sequence":"first","affiliation":[]},{"given":"Gregory","family":"Kucherov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,29]]},"reference":[{"issue":"5","key":"3_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(96)00117-2","volume":"59","author":"R.A. Baeza-Yates","year":"1996","unstructured":"R.A. Baeza-Yates and L.O. Fuentes. A framework to animate string algorithms. Inform. Process. Lett., 59(5):241\u2013244, 1996.","journal-title":"Inform. Process. Lett."},{"unstructured":"Fran\u00e7ois Bertault. Padnon: un logiciel de trac\u00e9 automatique de graphes en trois dimensions. Research Report 3130, INRIA, March 1997.","key":"3_CR2"},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"A. Blumer, J. Blumer, D. Haussier, A. Ehrenfeucht, M. T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theoretical Computer Science, 40:31\u201355, 1985.","journal-title":"Theoretical Computer Science"},{"unstructured":"Christian Charras and Thierry Lecroq. Exact string matching algorithms. URL: http:\/\/wvw.dir.univ-rouen.fr\/~charras\/string\/.","key":"3_CR4"},{"unstructured":"Maxim Crochemore and Wojciech Rytter. Text Algorithms. Oxford University Press, 1994.","key":"3_CR5"},{"doi-asserted-by":"crossref","unstructured":"G. Kucherov and M. Rusinowitch. Matching a set of strings with variable length don't cares. In E. Ukkonen, editor, Proceedings of the 6th Symposium on Combinatorial Pattern Matching, volume 937 of Lecture Notes in Computer Science, pages 230\u2013247, Helsinki (Finland), July 1995. Springer-Verlag.","key":"3_CR6","DOI":"10.1007\/3-540-60044-2_46"}],"container-title":["Lecture Notes in Computer Science","Automata Implementation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0031378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T09:47:00Z","timestamp":1548064020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0031378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646945","9783540691044"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0031378","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}