{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T10:44:10Z","timestamp":1773571450155,"version":"3.50.1"},"reference-count":11,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1051\/ita:2008030","type":"journal-article","created":{"date-parts":[[2008,12,3]],"date-time":"2008-12-03T08:05:15Z","timestamp":1228291515000},"page":"281-297","source":"Crossref","is-referenced-by-count":21,"title":["Efficient validation and construction of border arrays and validation of string matching automata"],"prefix":"10.1051","volume":"43","author":[{"given":"Jean-Pierre","family":"Duval","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Lecroq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Lefebvre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2008,12,4]]},"reference":[{"key":"R1","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman,The design and analysis of computer algorithms. Addison-Wesley (1974)."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"M. Crochemore, C. Hancart and T. Lecroq,Algorithms on Strings. Cambridge University Press (2007).","DOI":"10.1017\/CBO9780511546853"},{"key":"R3","first-page":"51","volume":"10","author":"Duval","year":"2005","journal-title":"J. Autom. Lang. Comb."},{"key":"R4","first-page":"223","volume":"42","author":"Fran\u011bk","year":"2002","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"R5","unstructured":"C. Hancart,Analyse exacte et en moyenne d'algorithmes de recherche d'un motif dans un texte. Ph.D. thesis. Universit\u00e9 Paris 7, France (1993)."},{"key":"R6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"R7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00009247","volume":"23","author":"Moore","year":"1999","journal-title":"Algorithmica"},{"key":"R8","unstructured":"J.H. Morris and V.R. Pratt Jr,A linear pattern-matching algorithm. Technical Report 40, University of California, Berkeley (1970)."},{"key":"R9","unstructured":"M. Naylor, Abacaba-dabacaba. http:\/\/www.ac.wwu.edu\/ mnaylor\/abacaba\/abacaba.html."},{"key":"R10","unstructured":"I. Simon, String matching algorithms and automata, inProceedings of the First South American Workshop on String Processing, edited by R. Baeza-Yates and N. Ziviani, Belo Horizonte, Brazil (1993) 151\u2013157"},{"key":"R11","unstructured":"W.F. Smyth,Computing Pattern in Strings. Addison Wesley Pearson (2003)."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2008030\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T19:19:53Z","timestamp":1557947993000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2008030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,4]]},"references-count":11,"journal-issue":{"issue":"2"},"alternative-id":["ita07065"],"URL":"https:\/\/doi.org\/10.1051\/ita:2008030","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,4]]}}}