{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:52:46Z","timestamp":1725486766111},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540715894"},{"type":"electronic","value":"9783540716181"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71618-1_61","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T02:05:53Z","timestamp":1183428353000},"page":"554-561","source":"Crossref","is-referenced-by-count":0,"title":["A Simple and Compact Algorithm for the RMQ and Its Application to the Longest Common Repeat Problem"],"prefix":"10.1007","author":[{"given":"Inbok","family":"Lee","sequence":"first","affiliation":[]},{"given":"Ha Yoon","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"61_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":"M.A. 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.\u00a01776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"issue":"2","key":"61_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jalgor.2005.08.001","volume":"57","author":"M.A. Bender","year":"2005","unstructured":"Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. Journal of Algorithms\u00a057(2), 75\u201394 (2005)","journal-title":"Journal of Algorithms"},{"key":"61_CR3","doi-asserted-by":"crossref","unstructured":"Berkman, O., Vishkin, U.: Recursive star-tree parallel data structure. SIAM Journal on Computing 22(2) (1993)","DOI":"10.1137\/0222017"},{"key":"61_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/11496656_15","volume-title":"Combinatorial Pattern Matching","author":"S. Dori","year":"2005","unstructured":"Dori, S., Landau, G.M.: Construction of Aho-Corasick Automaton in Linear Time for Integer Alphabets. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 168\u2013177. Springer, Heidelberg (2005)"},{"key":"61_CR5","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: FOCS, pp. 390\u2013398 (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"key":"61_CR6","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.\u00a04009, pp. 36\u201348. Springer, Heidelberg (2006)"},{"issue":"2","key":"61_CR7","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 ancestor. SIAM Journal on Computing\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"61_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/3-540-45061-0_73","volume-title":"Automata, Languages and Programming","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.\u00a02719, pp. 943\u2013945. Springer, Heidelberg (2003)"},{"key":"61_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., 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.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"key":"61_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-44888-8_14","volume-title":"Combinatorial Pattern Matching","author":"D.K. Kim","year":"2003","unstructured":"Kim, D.K., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 186\u2013199. Springer, Heidelberg (2003)"},{"issue":"3","key":"61_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.ipl.2004.03.017","volume":"91","author":"S.-R. Kim","year":"2004","unstructured":"Kim, S.-R., Lee, I., Park, K.: A fast algorithm for the generalised k-keyword proximity problem given keyword offsets. Information Processing Letters\u00a091(3), 115\u2013120 (2004)","journal-title":"Information Processing Letters"},{"key":"61_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","volume-title":"Combinatorial Pattern Matching","author":"P. Ko","year":"2003","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 200\u2013210. Springer, Heidelberg (2003)"},{"key":"61_CR13","doi-asserted-by":"crossref","unstructured":"Lee, I., Iliopoulos, C.S., Park, K.: Linear time algorithm for the longest common repeat problem. In: Proceedings of the 11th String Processing and Information Retrieval (SPIRE 2004), pp. 10\u201317 (2004)","DOI":"10.1007\/978-3-540-30213-1_2"},{"key":"61_CR14","doi-asserted-by":"crossref","unstructured":"Lee, I., Pinzon Ardila, Y.J.: Linear time algorithm for the generalised longest common repeat problem. In: Proceedings of the 12th String Processing and Information Retrieval (SPIRE 2005), pp. 191\u2013201 (2005)","DOI":"10.1007\/11575832_21"},{"issue":"6","key":"61_CR15","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 ancestor: Simplification and parallelization. SIAM Journal on Computing\u00a017(6), 1253\u20131262 (1988)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Adaptive and Natural Computing Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71618-1_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:52:12Z","timestamp":1619517132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71618-1_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540715894","9783540716181"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71618-1_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}