{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T19:48:21Z","timestamp":1770493701604,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:00:00Z","timestamp":1648512000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:00:00Z","timestamp":1648512000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1703489"],"award-info":[{"award-number":["1703489"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["2112643"],"award-info":[{"award-number":["2112643"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s00453-022-00955-7","type":"journal-article","created":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T16:24:02Z","timestamp":1648571042000},"page":"2088-2105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Heaviest Induced Ancestors Problem: Better Data Structures and Applications"],"prefix":"10.1007","volume":"84","author":[{"given":"Paniz","family":"Abedin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sahar","family":"Hooshmand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnab","family":"Ganguly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6852-1035","authenticated-orcid":false,"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,29]]},"reference":[{"key":"955_CR1","doi-asserted-by":"publisher","unstructured":"Abedin, P., Hooshmand, S., Ganguly, A., Thankachan, S.V.: The heaviest induced ancestors problem revisited. In: Navarro, G., Sankoff, D., Zhu, B. (eds.) Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2\u20134, 2018 - Qingdao, China, LIPIcs, vol. 105, pp. 20:1\u201320:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2018.20","DOI":"10.4230\/LIPIcs.CPM.2018.20"},{"key":"955_CR2","doi-asserted-by":"crossref","unstructured":"Aluru, S.: Handbook of Computational Molecular Biology. Chapman and Hall\/CRC (2005)","DOI":"10.1201\/9781420036275"},{"key":"955_CR3","doi-asserted-by":"publisher","unstructured":"Amir, A., Boneh, I.: Locally maximal common factors as a tool for efficient dynamic string algorithms. In: Navarro, G., Sankoff, D., Zhu, B. (eds.) Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2\u20134, 2018 - Qingdao, China, LIPIcs, vol. 105, pp. 11:1\u201311:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2018.11","DOI":"10.4230\/LIPIcs.CPM.2018.11"},{"key":"955_CR4","doi-asserted-by":"publisher","unstructured":"Amir, A., Boneh, I., Charalampopoulos, P., Kondratovsky, E.: Repetition detection in a dynamic string. In: Bender, M.A.,\u00a0Svensson, O.,\u00a0Herman, G. (eds.) 27th Annual European Symposium on Algorithms, ESA 2019, September 9\u201311, 2019, Munich\/Garching, Germany, LIPIcs, vol. 144, pp. 5:1\u20135:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.5","DOI":"10.4230\/LIPIcs.ESA.2019.5"},{"key":"955_CR5","doi-asserted-by":"publisher","unstructured":"Amir, A., Charalampopoulos, P., Iliopoulos, C.S., Pissis, S.P., Radoszewski, J.: Longest common factor after one edit operation. In:\u00a0Fici, G.,\u00a0Sciortino, M.,\u00a0Venturini, R. (eds.) String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26\u201329, 2017, Proceedings, Lecture Notes in Computer Science, vol. 10508, pp. 14\u201326. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-67428-5_2","DOI":"10.1007\/978-3-319-67428-5_2"},{"key":"955_CR6","doi-asserted-by":"publisher","unstructured":"Amir, A., Charalampopoulos, P., Pissis, S.P., Radoszewski, J.: Longest common substring made fully dynamic. In: Bender, M.A.,\u00a0Svensson, O.,\u00a0Herman, G. (eds.) 27th Annual European Symposium on Algorithms, ESA 2019, September 9\u201311, 2019, Munich\/Garching, Germany, LIPIcs, vol. 144, pp. 6:1\u20136:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.6","DOI":"10.4230\/LIPIcs.ESA.2019.6"},{"issue":"12","key":"955_CR7","doi-asserted-by":"publisher","first-page":"3707","DOI":"10.1007\/s00453-020-00744-0","volume":"82","author":"A Amir","year":"2020","unstructured":"Amir, A., Charalampopoulos, P., Pissis, S.P., Radoszewski, J.: Dynamic and internal longest common substring. Algorithmica 82(12), 3707\u20133743 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00744-0","journal-title":"Algorithmica"},{"key":"955_CR8","doi-asserted-by":"publisher","unstructured":"Amir, A., Kondratovsky, E.: Searching for a modified pattern in a changing text. In:\u00a0Gagie, T.,\u00a0Moffat, A.,\u00a0Navarro, G.,\u00a0Cuadros-Vargas, E. (eds.) String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9\u201311, 2018, Proceedings, Lecture Notes in Computer Science, vol. 11147, pp. 241\u2013253. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-00479-8_20","DOI":"10.1007\/978-3-030-00479-8_20"},{"key":"955_CR9","doi-asserted-by":"publisher","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H.,\u00a0Panario, D.,\u00a0Viola, A. (eds.) LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10\u201314, 2000, Proceedings, Lecture Notes in Computer Science, vol. 1776, pp. 88\u201394. Springer (2000). https:\/\/doi.org\/10.1007\/10719839_9","DOI":"10.1007\/10719839_9"},{"key":"955_CR10","doi-asserted-by":"publisher","unstructured":"Brodal, G.S., J\u00f8rgensen, A.G.: Data structures for range median queries. In:\u00a0Dong, Y.,\u00a0Du, D., Ibarra, O.H. (eds.) Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16\u201318, 2009. Proceedings, Lecture Notes in Computer Science, vol. 5878, pp. 822\u2013831. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_83","DOI":"10.1007\/978-3-642-10631-6_83"},{"key":"955_CR11","doi-asserted-by":"publisher","unstructured":"Chan, T.M., Larsen, K.G., Patrascu, M.: Orthogonal range searching on the RAM, revisited. In: Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13\u201315, 2011, pp. 1\u201310 (2011). https:\/\/doi.org\/10.1145\/1998196.1998198.","DOI":"10.1145\/1998196.1998198"},{"key":"955_CR12","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Gawrychowski, P., Pokorski, K.: Dynamic longest common substring in polylogarithmic time. In:\u00a0Czumaj, A.,\u00a0Dawar, A.,\u00a0Merelli, E. (eds.) 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8\u201311, 2020, Saarbr\u00fccken, Germany (Virtual Conference), LIPIcs, vol. 168, pp. 27:1\u201327:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.27","DOI":"10.4230\/LIPIcs.ICALP.2020.27"},{"key":"955_CR13","doi-asserted-by":"publisher","unstructured":"Chockalingam, S.P., Thankachan, S.V., Aluru, S.: A parallel algorithm for finding all pairs k-mismatch maximal common substrings. In:\u00a0West, J., Pancake, C.M. (eds.) Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2016, Salt Lake City, UT, USA, November 13\u201318, 2016, pp. 784\u2013794. IEEE Computer Society (2016). https:\/\/doi.org\/10.1109\/SC.2016.66","DOI":"10.1109\/SC.2016.66"},{"issue":"3","key":"955_CR14","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00453-012-9683-x","volume":"68","author":"ED Demaine","year":"2014","unstructured":"Demaine, E.D., Landau, G.M., Weimann, O.: On cartesian trees and range minimum queries. Algorithmica 68(3), 610\u2013625 (2014). https:\/\/doi.org\/10.1007\/s00453-012-9683-x","journal-title":"Algorithmica"},{"key":"955_CR15","doi-asserted-by":"publisher","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: 38th Annual Symposium on Foundations of Computer Science, FOCS \u201997, Miami Beach, Florida, USA, October 19\u201322, 1997, pp. 137\u2013143. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646102","DOI":"10.1109\/SFCS.1997.646102"},{"issue":"4","key":"955_CR16","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52(4), 552\u2013581 (2005). https:\/\/doi.org\/10.1145\/1082036.1082039","journal-title":"J. ACM"},{"issue":"2","key":"955_CR17","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1137\/090779759","volume":"40","author":"J Fischer","year":"2011","unstructured":"Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465\u2013492 (2011). https:\/\/doi.org\/10.1137\/090779759","journal-title":"SIAM J. Comput."},{"key":"955_CR18","doi-asserted-by":"publisher","unstructured":"Funakoshi, M., Mieno, T.: Minimal unique palindromic substrings after single-character substitution. In:\u00a0Lecroq, T.,\u00a0Touzet, H. (eds.) String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4\u20136, 2021, Proceedings, Lecture Notes in Computer Science, vol. 12944, pp. 33\u201346. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-86692-1_4","DOI":"10.1007\/978-3-030-86692-1_4"},{"key":"955_CR19","doi-asserted-by":"publisher","unstructured":"Funakoshi, M., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Longest substring palindrome after edit. In:\u00a0Navarro, G.,\u00a0Sankoff, D.,\u00a0Zhu, B. (eds.) Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2\u20134, 2018 - Qingdao, China, LIPIcs, vol. 105, pp. 12:1\u201312:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2018.12","DOI":"10.4230\/LIPIcs.CPM.2018.12"},{"key":"955_CR20","doi-asserted-by":"publisher","unstructured":"Funakoshi, M., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Faster queries for longest substring palindrome after block edit. In:\u00a0Pisanti, N., Pissis, S.P. (eds.) 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18\u201320, 2019, Pisa, Italy, LIPIcs, vol. 128, pp. 27:1\u201327:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2019.27","DOI":"10.4230\/LIPIcs.CPM.2019.27"},{"key":"955_CR21","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tcs.2021.01.014","volume":"859","author":"M Funakoshi","year":"2021","unstructured":"Funakoshi, M., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Computing longest palindromic substring after single-character or block-wise edits. Theor. Comput. Sci. 859, 116\u2013133 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.01.014","journal-title":"Theor. Comput. Sci."},{"key":"955_CR22","unstructured":"Gagie, T., Gawrychowski, P., Nekrich, Y.: Heaviest induced ancestors and longest common substrings. In: Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8\u201310, 2013. Carleton University, Ottawa, Canada (2013). http:\/\/cccg.ca\/proceedings\/2013\/papers\/paper_29.pdf"},{"issue":"2","key":"955_CR23","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1137\/S0097539702402354","volume":"35","author":"R Grossi","year":"2005","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput. 35(2), 378\u2013407 (2005). https:\/\/doi.org\/10.1137\/S0097539702402354","journal-title":"SIAM J. Comput."},{"key":"955_CR24","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)"},{"issue":"2","key":"955_CR25","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). https:\/\/doi.org\/10.1137\/0213024","journal-title":"SIAM J. Comput."},{"key":"955_CR26","doi-asserted-by":"publisher","unstructured":"J\u00e1J\u00e1, J., Mortensen, C.W., Shi, Q.: Space-efficient and fast algorithms for multidimensional dominance reporting and counting. In:\u00a0Fleischer, R.,\u00a0Trippen, G. (eds.) Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20\u201322, 2004, Proceedings, Lecture Notes in Computer Science, vol. 3341, pp. 558\u2013568. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-30551-4_49","DOI":"10.1007\/978-3-540-30551-4_49"},{"key":"955_CR27","doi-asserted-by":"publisher","unstructured":"Nekrich, Y., Navarro, G.: Sorted range reporting. In: Fomin, F.V.,\u00a0Kaski, P. (eds.) Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4\u20136, 2012. Proceedings, Lecture Notes in Computer Science, vol. 7357, pp. 271\u2013282. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-31155-0_24","DOI":"10.1007\/978-3-642-31155-0_24"},{"key":"955_CR28","unstructured":"Sadakane, K.: Succinct representations of lcp information and improvements in the compressed suffix arrays. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6\u20138, 2002, San Francisco, CA, USA., pp. 225\u2013232 (2002). http:\/\/dl.acm.org\/citation.cfm?id=545381.545410"},{"key":"955_CR29","doi-asserted-by":"publisher","unstructured":"Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17\u201319, 2010, pp. 134\u2013149 (2010). https:\/\/doi.org\/10.1137\/1.9781611973075.13","DOI":"10.1137\/1.9781611973075.13"},{"key":"955_CR30","doi-asserted-by":"publisher","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing, May 11\u201313, 1981, Milwaukee, Wisconsin, USA, pp. 114\u2013122 (1981). https:\/\/doi.org\/10.1145\/800076.802464","DOI":"10.1145\/800076.802464"},{"key":"955_CR31","doi-asserted-by":"publisher","unstructured":"Thankachan, S.V., Chockalingam, S.P., Aluru, S.: An efficient algorithm for finding all pairs k-mismatch maximal common substrings. In: Bourgeois, A.G.,\u00a0Skums, P.,\u00a0Wan, X.,\u00a0Zelikovsky, A. (eds.) Bioinformatics Research and Applications - 12th International Symposium, ISBRA 2016, Minsk, Belarus, June 5\u20138, 2016, Proceedings, Lecture Notes in Computer Science, vol. 9683, pp. 3\u201314. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-38782-6_1","DOI":"10.1007\/978-3-319-38782-6_1"},{"key":"955_CR32","doi-asserted-by":"publisher","unstructured":"Urabe, Y., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Longest lyndon substring after edit. In:\u00a0Navarro, G.,\u00a0Sankoff, D.,\u00a0Zhu, B. (eds.) Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2\u20134, 2018 - Qingdao, China, LIPIcs, vol. 105, pp. 19:1\u201319:10. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2018.19","DOI":"10.4230\/LIPIcs.CPM.2018.19"},{"key":"955_CR33","doi-asserted-by":"publisher","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, October 15\u201317, 1973, pp. 1\u201311 (1973). https:\/\/doi.org\/10.1109\/SWAT.1973.13","DOI":"10.1109\/SWAT.1973.13"},{"issue":"2","key":"955_CR34","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"DE Willard","year":"1983","unstructured":"Willard, D.E.: Log-logarithmic worst-case range queries are possible in space theta(n). Inf. Process. Lett. 17(2), 81\u201384 (1983). https:\/\/doi.org\/10.1016\/0020-0190(83)90075-3","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"955_CR35","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ipl.2015.09.002","volume":"116","author":"G Zhou","year":"2016","unstructured":"Zhou, G.: Two-dimensional range successor in optimal time and almost linear space. Inf. Process. Lett. 116(2), 171\u2013174 (2016). https:\/\/doi.org\/10.1016\/j.ipl.2015.09.002","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"955_CR36","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 23(3), 337\u2013343 (1977). https:\/\/doi.org\/10.1109\/TIT.1977.1055714","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00955-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-00955-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00955-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T11:06:11Z","timestamp":1655982371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-00955-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,29]]},"references-count":36,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["955"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-00955-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,29]]},"assertion":[{"value":"22 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}