{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:28:36Z","timestamp":1777868916990,"version":"3.51.4"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003725","name":"NRF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115824","type":"journal-article","created":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:16:14Z","timestamp":1771546574000},"page":"115824","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Encodings for range minimum queries over bounded alphabets"],"prefix":"10.1016","volume":"1070","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8644-3691","authenticated-orcid":false,"given":"Seungbum","family":"Jo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0636-9880","authenticated-orcid":false,"given":"Srinivasa Rao","family":"Satti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115824_bib0001","series-title":"36Th Annual Symposium on Combinatorial Pattern Matching, CPM 2025, June 17\u201319, 2025, Milan, Italy","first-page":"25:1","article-title":"Encodings for range minimum queries over bounded alphabets","volume":"331","author":"Jo","year":"2025"},{"issue":"2","key":"10.1016\/j.tcs.2026.115824_bib0002","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1137\/090779759","article-title":"Space-Efficient preprocessing schemes for range minimum queries on static arrays","volume":"40","author":"Fischer","year":"2011","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115824_bib0003","series-title":"Soda","first-page":"150","article-title":"Data structures for range minimum queries in multidimensional arrays","author":"Yuan","year":"2010"},{"issue":"4","key":"10.1016\/j.tcs.2026.115824_bib0004","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1007\/s00453-011-9499-0","article-title":"On space efficient two dimensional range minimum data structures","volume":"63","author":"Brodal","year":"2012","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115824_bib0005","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.tcs.2016.02.016","article-title":"Two dimensional range minimum queries and fibonacci lattices","volume":"638","author":"Brodal","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115824_bib0006","series-title":"Data structures for efficient string algorithms","author":"Fischer","year":"2007"},{"issue":"4","key":"10.1016\/j.tcs.2026.115824_bib0007","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1290672.1290680","article-title":"Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets","volume":"3","author":"Raman","year":"2007","journal-title":"ACM Trans. Algorithm."},{"issue":"2","key":"10.1016\/j.tcs.2026.115824_bib0008","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/j.tcs.2026.115824_bib0009","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","article-title":"On finding lowest common ancestors: simplification and parallelization","volume":"17","author":"Schieber","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2026.115824_bib0010","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.tcs.2003.05.002","article-title":"The level ancestor problem simplified","volume":"321","author":"Bender","year":"2004","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115824_bib0011","series-title":"Automata, Languages and Programming","first-page":"341","article-title":"On cartesian trees and range minimum queries","author":"Demaine","year":"2009"},{"issue":"1","key":"10.1016\/j.tcs.2026.115824_bib0012","doi-asserted-by":"crossref","first-page":"2:1","DOI":"10.1145\/3375890","article-title":"Fully functional suffix trees and optimal text searching in BWT-Runs bounded space","volume":"67","author":"Gagie","year":"2020","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.115824_bib0013","series-title":"Cpm","first-page":"24:1","article-title":"Text indexing and searching in sublinear time","volume":"161","author":"Munro","year":"2020"},{"issue":"2","key":"10.1016\/j.tcs.2026.115824_bib0014","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s00453-016-0199-7","article-title":"Full-Fledged real-Time indexing for constant size alphabets","volume":"79","author":"Kucherov","year":"2017","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115824_bib0015","series-title":"Spire","first-page":"150","article-title":"An alphabet-Friendly FM-Index","volume":"3246","author":"Ferragina","year":"2004"},{"key":"10.1016\/j.tcs.2026.115824_bib0016","series-title":"Soda","first-page":"841","article-title":"High-order entropy-compressed text indexes","author":"Grossi","year":"2003"},{"key":"10.1016\/j.tcs.2026.115824_bib0017","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.jda.2013.07.004","article-title":"Wavelet trees for all","volume":"25","author":"Navarro","year":"2014","journal-title":"J. Discrete Algorithm."},{"issue":"4","key":"10.1016\/j.tcs.2026.115824_bib0018","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/358841.358852","article-title":"A unifying look at data structures","volume":"23","author":"Vuillemin","year":"1980","journal-title":"Commun. ACM"},{"key":"10.1016\/j.tcs.2026.115824_bib0019","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.tcs.2019.07.002","article-title":"Compressed range minimum queries","volume":"812","author":"Gawrychowski","year":"2020","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115824_bib0020","series-title":"Esa","first-page":"70:1","article-title":"Hypersuccinct trees - New universal tree source codes for optimal compressed tree data structures and range minima","volume":"204","author":"Munro","year":"2021"},{"key":"10.1016\/j.tcs.2026.115824_bib0021","series-title":"Esa","first-page":"229","article-title":"The encoding complexity of two dimensional range minimum data structures","volume":"8125","author":"Brodal","year":"2013"},{"key":"10.1016\/j.tcs.2026.115824_bib0022","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.tcs.2015.10.012","article-title":"Encoding 2d range maximum queries","volume":"609","author":"Golin","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115824_bib0023","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcta.2019.105177","article-title":"Asymptotic enumeration of compacted binary trees of bounded right height","volume":"172","author":"Genitrini","year":"2020","journal-title":"J. Comb. Theory A"},{"key":"10.1016\/j.tcs.2026.115824_bib0024","series-title":"Computing and Combinatorics - 18Th Annual International Conference, COCOON 2012, Sydney, Australia, August 20\u201322, 2012. Proceedings","first-page":"396","article-title":"Succinct representations of binary trees for range minimum queries","volume":"7434","author":"Davoodi","year":"2012"},{"issue":"1","key":"10.1016\/j.tcs.2026.115824_bib0025","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0012-365X(83)90012-2","article-title":"Note on the number of minimal lattice paths restricted by two parallel lines","volume":"44","author":"Sato","year":"1983","journal-title":"Discret. Math."},{"key":"10.1016\/j.tcs.2026.115824_bib0026","series-title":"Proceedings of the 42Nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5\u20138 June 2010","first-page":"593","article-title":"Changing base without losing space","author":"Dodis","year":"2010"},{"key":"10.1016\/j.tcs.2026.115824_bib0027","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.tcs.2017.02.017","article-title":"Encoding nearest larger values","volume":"710","author":"Hoffmann","year":"2018","journal-title":"Theor. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000836?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000836?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T12:52:10Z","timestamp":1777553530000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":27,"alternative-id":["S0304397526000836"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115824","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Encodings for range minimum queries over bounded alphabets","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115824","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115824"}}