{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:38:27Z","timestamp":1725849507206},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319295152"},{"type":"electronic","value":"9783319295169"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-29516-9_5","type":"book-chapter","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T05:05:19Z","timestamp":1455858319000},"page":"52-64","source":"Crossref","is-referenced-by-count":0,"title":["Longest Common Extensions in Partial Words"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachel","family":"Harred","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Lazarow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,20]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0222017","volume":"22","author":"O Berkman","year":"1993","unstructured":"Berkman, O., Vishkin, U.: Recursive star-free parallel data structure. SIAM J. Comput. 22, 221\u2013242 (1993)","journal-title":"SIAM J. Comput."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-37064-9_16","volume-title":"Language and Automata Theory and Applications","author":"F Blanchet-Sadri","year":"2013","unstructured":"Blanchet-Sadri, F., Lazarow, J.: Suffix trees for partial words and the longest common compatible prefix problem. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 165\u2013176. Springer, Heidelberg (2013)"},{"key":"5_CR4","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Langiu, A., Radoszewski, J., Rytter, W., Szreder, B., Wale\u0144, T.: A note on the longest common compatible prefix problem for partial words (2013). \n                    arxiv:1312.2381v1"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11780441_5","volume-title":"Combinatorial Pattern Matching","author":"J Fischer","year":"2006","unstructured":"Fischer, J., Heun, V.: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 36\u201348. Springer, Heidelberg (2006)"},{"key":"5_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.jcss.2004.03.004","volume":"69","author":"D Gusfield","year":"2004","unstructured":"Gusfield, D., Stoye, J.: Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci. 69, 525\u2013546 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.jda.2010.08.004","volume":"8","author":"L Ilie","year":"2010","unstructured":"Ilie, L., Navarro, G., Tinta, L.: The longest common extension problem revisited and applications to approximate string searching. J. Discrete Algorithms 8(4), 418\u2013428 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"5_CR10","series-title":"LNCS","first-page":"943","volume-title":"ICALP 2003","author":"J K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 943\u2013955. Springer, Berlin (2003)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T Kasai","year":"2001","unstructured":"Kasai, T., Lee, G.H., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/106652701300099038","volume":"8","author":"G Landau","year":"2001","unstructured":"Landau, G., Schmidt, J.P., Sokol, D.: An algorithm for approximate tandem repeats. J. Comput. Biol. 8, 1\u201318 (2001)","journal-title":"J. Comput. Biol."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Landau, G., Vishkin, U.: Introducing efficient parallelism into approximate string matching and a new serial algorithm. In: STOC 1986, pp. 220\u2013230. ACM Press (1986)","DOI":"10.1145\/12130.12152"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G Landau","year":"1989","unstructured":"Landau, G., Vishkin, U.: Fast parallel and serial approximate string matching. J. Algorithms 10, 157\u2013169 (1989)","journal-title":"J. Algorithms"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"MG Main","year":"1984","unstructured":"Main, M.G., Lorentz, R.J.: An O(nlog n) algorithm for finding all repetitions in a string. J. Algorithms 5(3), 422\u2013432 (1984)","journal-title":"J. Algorithms"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/11532323_25","volume-title":"Advances in Bioinformatics and Computational Biology","author":"R Castro Miranda de","year":"2005","unstructured":"de Castro Miranda, R., Ayala-Rinc\u00f3n, M.: A modification of the Landau-Vishkin algorithm computing longest common extensions via suffix arrays. In: Setubal, J.C., Verjovski-Almeida, S. (eds.) BSB 2005. LNCS (LNBI), vol. 3594, pp. 210\u2013213. Springer, Heidelberg (2005)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01840446","volume":"1","author":"G Myers","year":"1986","unstructured":"Myers, G.: An O(nd) difference algorithm and its variations. Algorithmica 1, 251\u2013266 (1986)","journal-title":"Algorithmica"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17, 1253\u20131262 (1988)","journal-title":"SIAM J. Comput."},{"key":"5_CR19","first-page":"1","volume":"1973","author":"P Weiner","year":"1973","unstructured":"Weiner, P.: Linear pattern matching algorithm. SWAT 1973, 1\u201311 (1973)","journal-title":"SWAT"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29516-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:45:55Z","timestamp":1559400355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29516-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319295152","9783319295169"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29516-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}