{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:53:59Z","timestamp":1725515639121},"publisher-location":"Boston, MA","reference-count":16,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387096797"},{"type":"electronic","value":"9780387096803"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-09680-3_10","type":"book-chapter","created":{"date-parts":[[2008,7,21]],"date-time":"2008-07-21T11:37:14Z","timestamp":1216640234000},"page":"143-155","source":"Crossref","is-referenced-by-count":0,"title":["On the Longest Common Factor Problem"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"given":"Alessandra","family":"Gabriele","sequence":"additional","affiliation":[]},{"given":"Filippo","family":"Mignosi","sequence":"additional","affiliation":[]},{"given":"Mauriana","family":"Pesaresi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M.I. Abouelhoda","year":"2004","unstructured":"M.I. Abouelhoda, S. Kurtz, and E. Ohlebusch. Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms, 2(1):53\u201386, 2004.","journal-title":"Journal of Discrete Algorithms"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"A. Apostolico. The myriad virtues of suffix trees. In A.Apostolico and Z.Galil, editors, Combinatorial Algorithms on Words, volume 12 of F, pages 85\u201396. 1985.","DOI":"10.1007\/978-3-642-82456-2_6"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(01)00222-5","volume":"292","author":"M. Crochemore","year":"2003","unstructured":"M. Crochemore. Reducing space for index implementation. Theoretical Computer Science, 292(1):185\u2013197, 2003.","journal-title":"Theoretical Computer Science"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"M. Crochemore, C. Epifanio, A. Gabriele, and F. Mignosi. On the suffix automaton with mismatches. In To appear in Lecture Notes in Computer Science. CIAA\u201907, 2007.","DOI":"10.1007\/978-3-540-76336-9_15"},{"key":"10_CR5","unstructured":"M. Crochemore, C. Hancart, and T. Lecroq. Algorithmique du texte. Vuibert Informatique, 2001."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"J. Fischer and V. Heun. Theoretical and practical improvements on the rmq-problem, with applications to lca and lce. In Springer LNCS, volume 4009 of Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching(CPM\u201906), pages 36\u201348, 2006.","DOI":"10.1007\/11780441_5"},{"key":"10_CR7","unstructured":"R. Grossi and G.F. Italiano. Suffix trees and their applications in string algorithms. Proceedings of the 1st South American Workshop on String Processing, pages 57\u201376, 1993."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal of Computing, 13:338\u2013355, 1984.","journal-title":"SIAM Journal of Computing"},{"key":"10_CR10","unstructured":"L.C.K. Hui. Color set size problem with applications to string matching. In Proceedings 3rd Symposium on Combinatorial Pattern Matching, volume 644 of Springer LNCS, pages 227\u2013240, 1992."},{"issue":"2","key":"10_CR11","first-page":"73","volume":"15","author":"L.C.K. Hui","year":"2000","unstructured":"L.C.K. Hui. A practical algorithm to find longest common substring in linear time. International Journal of Computer Systems Science & Engineering, 15(2):73\u201376, 2000.","journal-title":"International Journal of Computer Systems Science & Engineering"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, G. Mauri, and G. Pavesi. On-line construction of compact directed acyclic word graphs. In Discrete Applied Mathematics, volume 146 of 12th Annual Symposium on Combinatorial Pattern Matching, pages 156\u2013179, 2005.","DOI":"10.1016\/j.dam.2004.04.012"},{"key":"10_CR13","unstructured":"Stefano Lonardi. Pattern Matching Pointers. http:\/\/www.cs.ucr.edu\/ stelo\/pattern.html, 2008."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/spe.698","volume":"36","author":"M.G. Maas","year":"2006","unstructured":"M.G. Maas. Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem. Software Practice and Experience, 36:305\u2013331, 2006.","journal-title":"Software Practice and Experience"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"E.M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262\u2013272, 1976.","journal-title":"Journal of the ACM"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin. On finding lowest common ancestors: simplifications and parallelizzation. SIAM Journal on Computing, 17:1253\u20131262, 1988.","journal-title":"SIAM Journal on Computing"}],"container-title":["IFIP International Federation for Information Processing","Fifth Ifip International Conference On Theoretical Computer Science \u2013 Tcs 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-09680-3_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:44:27Z","timestamp":1619574267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-09680-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387096797","9780387096803"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09680-3_10","relation":{},"ISSN":["1571-5736"],"issn-type":[{"type":"print","value":"1571-5736"}],"subject":[]}}