{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:30:50Z","timestamp":1743003050150,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642250101"},{"type":"electronic","value":"9783642250118"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25011-8_3","type":"book-chapter","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T20:27:34Z","timestamp":1320784054000},"page":"31-43","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Longest Previous Factor"],"prefix":"10.1007","author":[{"given":"Richard","family":"Beal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald","family":"Adjeroh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2007.10.006","volume":"106","author":"M. Crochemore","year":"2008","unstructured":"Crochemore, M., Ilie, L.: Computing longest previous factor in linear time and applications. Inf. Process. Lett.\u00a0106(2), 75\u201380 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory\u00a023(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1-2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0166-218X(89)90051-6","volume":"25","author":"M. Main","year":"1989","unstructured":"Main, M.: Detecting leftmost maximal periodicities. Discrete Appl. Math.\u00a025(1-2), 145\u2013153 (1989)","journal-title":"Discrete Appl. Math."},{"key":"3_CR4","first-page":"71","volume-title":"STOC 1993","author":"B. Baker","year":"1993","unstructured":"Baker, B.: A theory of parameterized pattern matching: Algorithms and applications. In: STOC 1993, pp. 71\u201380. ACM, New York (1993)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0020-0190(94)90086-8","volume":"49","author":"A. Amir","year":"1994","unstructured":"Amir, A., Farach, M., Muthukrishnan, S.: Alphabet dependence in parameterized matching. Inf. Process. Lett.\u00a049, 111\u2013115 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-003-1067-9","volume":"39","author":"T. Shibuya","year":"2004","unstructured":"Shibuya, T.: Generalization of a suffix tree for RNA structural pattern matching. Algorithmica\u00a039(1), 1\u201319 (2004)","journal-title":"Algorithmica"},{"issue":"9","key":"3_CR7","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/TSE.2007.70720","volume":"33","author":"B. Baker","year":"2007","unstructured":"Baker, B.: Finding clones with dup: Analysis of an experiment. IEEE Trans. Software Eng.\u00a033(9), 608\u2013621 (2007)","journal-title":"IEEE Trans. Software Eng."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MSPEC.2010.5583460","volume":"47","author":"B. Zeidman","year":"2010","unstructured":"Zeidman, B.: Software v. software. IEEE Spectr.\u00a047, 32\u201353 (2010)","journal-title":"software. IEEE Spectr."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-10217-2_31","volume-title":"Combinatorial Algorithms","author":"I. Tomohiro","year":"2009","unstructured":"Tomohiro, I., Deguchi, S., Bannai, H., Inenaga, S., Takeda, M.: Lightweight Parameterized Suffix Array Construction. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 312\u2013323. Springer, Heidelberg (2009)"},{"key":"3_CR10","unstructured":"Deguchi, S., Higashijima, F., Bannai, H., Inenaga, S., Takeda, M.: Parameterized suffix arrays for binary strings. In: PSC 2008, Czech Republic, pp. 84\u201394 (2008)"},{"key":"3_CR11","series-title":"LNCS","first-page":"44","volume-title":"IWOCA 2011","author":"R. Beal","year":"2011","unstructured":"Beal, R., Adjeroh, D.: p-Suffix Sorting as Arithmetic Coding. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 44\u201356. Springer, Heidelberg (2011)"},{"key":"3_CR12","unstructured":"Beal, R.: Parameterized Strings: Algorithms and Data Structures. MS Thesis. West Virginia University (2011)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput.\u00a022, 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"key":"3_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"3_CR15","volume-title":"Computing Patterns in Strings","author":"W. Smyth","year":"2003","unstructured":"Smyth, W.: Computing Patterns in Strings. Pearson, New York (2003)"},{"key":"3_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78909-5","volume-title":"The Burrows-Wheeler Transform: Data Compression, Suffix Arrays and Pattern Matching","author":"D. Adjeroh","year":"2008","unstructured":"Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows-Wheeler Transform: Data Compression, Suffix Arrays and Pattern Matching. Springer, New York (2008)"},{"key":"3_CR17","first-page":"541","volume-title":"SODA 1995","author":"B. Baker","year":"1995","unstructured":"Baker, B.: Parameterized pattern matching by Boyer-Moore-type algorithms. In: SODA 1995, pp. 541\u2013550. ACM, Philadelphia (1995)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0304-3975(94)00270-3","volume":"154","author":"R. Idury","year":"1996","unstructured":"Idury, R., Sch\u00e4ffer, A.: Multiple matching of parameterized patterns. Theor. Comput. Sci.\u00a0154, 203\u2013224 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Ilie, L., Smyth, W.: A simple algorithm for computing the Lempel Ziv factorization. In: DCC 2008, pp. 482\u2013488 (2008)","DOI":"10.1109\/DCC.2008.36"},{"key":"3_CR20","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., et al.: Linear-time Longest-common-prefix Computation in Suffix Arrays and its Applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-27810-8_32","volume-title":"Algorithm Theory - SWAT 2004","author":"G. Manzini","year":"2004","unstructured":"Manzini, G.: Two Space Saving Tricks for Linear Time LCP Array Computation. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 372\u2013383. Springer, Heidelberg (2004)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-02441-2_17","volume-title":"Combinatorial Pattern Matching","author":"J. K\u00e4rkk\u00e4inen","year":"2009","unstructured":"K\u00e4rkk\u00e4inen, J., Manzini, G., Puglisi, S.: Permuted Longest-common-prefix Array. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009 Lille. LNCS, vol.\u00a05577, pp. 181\u2013192. Springer, Heidelberg (2009)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-92182-0_14","volume-title":"Algorithms and Computation","author":"S. Puglisi","year":"2008","unstructured":"Puglisi, S., Turpin, A.: Space-time Tradeoffs for Longest-Common-prefix Array Computation. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 124\u2013135. Springer, Heidelberg (2008)"},{"issue":"8-9","key":"3_CR24","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.ipl.2010.02.010","volume":"110","author":"J. Fischer","year":"2010","unstructured":"Fischer, J.: Wee LCP. Inf. Process. Lett.\u00a0110(8-9), 317\u2013320 (2010)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25011-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T01:16:18Z","timestamp":1555377378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25011-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642250101","9783642250118"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25011-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}