{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:21Z","timestamp":1725491421506},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372134"},{"type":"electronic","value":"9783540372141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_9","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T09:32:31Z","timestamp":1155115951000},"page":"78-89","source":"Crossref","is-referenced-by-count":2,"title":["Factor Oracles"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucian","family":"Ilie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emine","family":"Seid-Hilmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_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":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-48194-X_5","volume-title":"Combinatorial Pattern Matching","author":"C. Allauzen","year":"2001","unstructured":"Allauzen, C., Crochemore, M., Raffinot, M.: Efficient experimental string matching by weak factor recognition. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 51\u201372. Springer, Heidelberg (2001)"},{"issue":"9","key":"9_CR3","first-page":"604","volume":"8","author":"G. Assayag","year":"2004","unstructured":"Assayag, G., Dubnov, S.: Using factor oracles for machine improvisation. Soft Comput.\u00a08(9), 604\u2013610 (2004)","journal-title":"Soft Comput."},{"key":"9_CR4","unstructured":"Cleophas, L., Zwaan, G., Watson, B.: Constructing factor oracles. In: Proceedings of the Prague Stringology Conference 2003, pp. 37\u201350 (2003)"},{"key":"9_CR5","unstructured":"Cleophas, L., Zwaan, G., Watson, B.: Constructing factor oracles. J. Autom. Lang. Comb. (to appear)"},{"key":"9_CR6","volume-title":"Jewels of stringology","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M., Rytter, W.: Jewels of stringology. World Scientific Publishing Co., Inc., River Edge (2003)"},{"issue":"6","key":"9_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.ipl.2004.11.011","volume":"93","author":"R. Kato","year":"2005","unstructured":"Kato, R., Watanabe, O.: Substring search and repeat search using factor oracles. Inf. Process. Lett.\u00a093(6), 269\u2013274 (2005)","journal-title":"Inf. Process. Lett."},{"key":"9_CR8","unstructured":"Lefebvre, A., Lecroq, T.: Computing repeated factors with a factor oracle. In: Proceedings of the 11th Australasian Workshop on Combinatorial Algorithms, pp. 145\u2013158 (2000)"},{"key":"9_CR9","unstructured":"Lefebvre, A., Lecroq, T.: Compror: compression with a factor oracle. In: Data Compression Conference 2001, p. 502 (2001)"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(01)00308-8","volume":"83","author":"A. Lefebvre","year":"2002","unstructured":"Lefebvre, A., Lecroq, T.: Compror: On-line lossless data compression with a factor oracle. Inf. Process. Lett.\u00a083(1), 1\u20136 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"12","key":"9_CR11","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1080\/00207160214653","volume":"79","author":"A. Lefebvre","year":"2002","unstructured":"Lefebvre, A., Lecroq, T.: A heuristic for computing repeats with a factor oracle: application to biological sequences. Int. J. Comput. Math.\u00a079(12), 1303\u20131315 (2002)","journal-title":"Int. J. Comput. Math."},{"key":"9_CR12","unstructured":"Lefebvre, A., Lecroq, T.: Drastic improvements over repeats found with a factor oracle. In: Proceedings of the 13th Australasian Workshop on Combinatorial Algorithms, pp. 253\u2013265 (2002)"},{"issue":"4","key":"9_CR13","first-page":"647","volume":"8","author":"A. Lefebvre","year":"2003","unstructured":"Lefebvre, A., Lecroq, T., Alexandre, J.: An improved algorithm for finding longest repeats with a modified factor oracle. J. Autom. Lang. Comb.\u00a08(4), 647\u2013657 (2003)","journal-title":"J. Autom. Lang. Comb."},{"key":"9_CR14","unstructured":"Mancheron, A., Moan, C.: Combinatorial characterization of the language recognized by factor and suffix oracles. In: Proceedings of the Prague Stringology Conference 2004, pp. 139\u2013154 (2004)"},{"issue":"6","key":"9_CR15","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. Int. J. Found. Comput. Sci.\u00a016(6), 1179\u20131191 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9_CR16","first-page":"484","volume-title":"Proc. Information Processing 1992, IFIP Transactions A-12","author":"E. Ukkonen","year":"1992","unstructured":"Ukkonen, E.: Constructing suffix trees on-line in linear time. In: Proc. Information Processing 1992, IFIP Transactions A-12, vol.\u00a01, pp. 484\u2013492. Elsevier, Amsterdam (1992)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:27:00Z","timestamp":1619508420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11812128_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}