{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:21:25Z","timestamp":1743006085934,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024405"},{"type":"electronic","value":"9783642024412"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02441-2_29","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T09:19:32Z","timestamp":1245230372000},"page":"326-338","source":"Crossref","is-referenced-by-count":0,"title":["Statistical Properties of Factor Oracles"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9mie","family":"Bourdon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irena","family":"Rusu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-47849-3_18","volume-title":"SOFSEM\u201999: Theory and Practice of Informatics","author":"C. Allauzen","year":"1999","unstructured":"Allauzen, C., Crochemore, M., Raffinot, M.: Factor Oracle: A New Structure for Pattern Matching. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol.\u00a01725, pp. 295\u2013310. Springer, Heidelberg (1999)"},{"key":"29_CR2","first-page":"1","volume":"8","author":"G. Assayag","year":"2004","unstructured":"Assayag, G., Dubnov, S.: Using Factor Oracles for Machine Improvisation. Soft Computing\u00a08, 1\u20137 (2004)","journal-title":"Soft Computing"},{"key":"29_CR3","unstructured":"Cleophas, L., Zwaan, G., Watson, B.W.: Constructing Factor Oracles. In: Proceedings of the Prague Stringology Conference 2003 (PSC 2003), pp. 37\u201350 (2003)"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(01)00222-5","volume":"292","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M.: Reducing space for index implementation. Theoretical Computer Science\u00a0292, 185\u2013197 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"29_CR5","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1142\/S0129054107004978","volume":"18","author":"M. Crochemore","year":"2007","unstructured":"Crochemore, M., Ilie, L., Seid-Hilmi, E.: The Structure of Factor Oracles. Int. J. Found. Comput. Sci.\u00a018(4), 781\u2013797 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"29_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(81)90005-4","volume":"30","author":"L.J. Guibas","year":"1981","unstructured":"Guibas, L.J., Odlyzko, A.M.: String Overlaps, Pattern Matching, and Nontransitive Games. J. Combin. Theory Ser. A\u00a030(2), 183\u2013208 (1981)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0097-3165(94)90065-5","volume":"66","author":"P. Jacquet","year":"1994","unstructured":"Jacquet, P., Szpankowski, W.: Autocorrelation on words and its applications: analysis of suffix trees by string-ruler approach. J. Combin. Theory Ser. A\u00a066(2), 237\u2013269 (1994)","journal-title":"J. Combin. Theory Ser. A"},{"key":"29_CR8","unstructured":"Kato, R.: A new full-text search algorithm using factor oracle as index, TR-C185, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Japan (2003)"},{"key":"29_CR9","unstructured":"Kato, R.: Finding maximal repeats with factor oracles, TR-C190, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Japan (2004)"},{"key":"29_CR10","unstructured":"Lecroq, T., Lefebvre, A.: Computing repeated factors with a factor oracle. In: Brankovic, L., Ryan, J. (eds.) Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms, pp. 145\u2013158 (2000)"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(01)00308-8","volume":"83","author":"T. Lecroq","year":"2002","unstructured":"Lecroq, T., Lefebvre, A.: Compror: on-line lossless data compression with a factor oracle. Information Processing Letters\u00a083, 1\u20136 (2002)","journal-title":"Information Processing Letters"},{"key":"29_CR12","unstructured":"Mancheron, A.: Extraction de motifs communs dans un ensemble de s\u00e9quences, Ph. D. thesis, University of Nantes, France (2006)"},{"issue":"6","key":"29_CR13","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1142\/S0129054105003741","volume":"16","author":"A. Mancheron","year":"2005","unstructured":"Mancheron, A., Moan, C.: Combinatorial characterization of the language recognized by factor and suffix oracles. International Journal of Foundations of Computer Science\u00a016(6), 1179\u20131191 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78773-0_1","volume-title":"LATIN 2008: Theoretical Informatics","author":"G. Park","year":"2008","unstructured":"Park, G., Hwang, H.-K., Nicod\u00e8me, P., Szpankowski, W.: Profile of Tries. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 1\u201311. Springer, Heidelberg (2008)"},{"issue":"4","key":"29_CR15","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/PL00009244","volume":"22","author":"M. R\u00e9gnier","year":"1998","unstructured":"R\u00e9gnier, M., Szpankowski, W.: On Pattern Frequency Occurrences in a Markovian Sequence. Algorithmica\u00a022(4), 631\u2013649 (1998)","journal-title":"Algorithmica"},{"issue":"2","key":"29_CR16","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.jda.2006.11.005","volume":"6","author":"I. Rusu","year":"2008","unstructured":"Rusu, I.: Converting Suffix Trees into Factor\/Suffix Oracles. Journal of Discrete Algorithms\u00a06(2), 324\u2013340 (2008)","journal-title":"Journal of Discrete Algorithms"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Szpankowski, W.: Average case analysis of algorithms on sequences. Wiley-Interscience Series in Discrete Mathematics and Optimization (2001)","DOI":"10.1002\/9781118032770"},{"key":"29_CR18","unstructured":"Wells, D.: The Penguin Book of Curious and Interesting Mathematics (1997)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02441-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:58:32Z","timestamp":1558267112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02441-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024405","9783642024412"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02441-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}