{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:09:35Z","timestamp":1778818175034,"version":"3.51.4"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["872539"],"award-info":[{"award-number":["872539"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["956229"],"award-info":[{"award-number":["956229"]}],"id":[{"id":"10.13039\/100010665","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,6]]},"DOI":"10.1016\/j.tcs.2026.115932","type":"journal-article","created":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:42:21Z","timestamp":1775230941000},"page":"115932","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Minimizing the minimizers via alphabet reordering"],"prefix":"10.1016","volume":"1076","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2399-3098","authenticated-orcid":false,"given":"Hilde","family":"Verbeek","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0846-2616","authenticated-orcid":false,"given":"Lorraine A.K.","family":"Ayad","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0888-5061","authenticated-orcid":false,"given":"Grigorios","family":"Loukides","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1445-1932","authenticated-orcid":false,"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115932_bib0001","series-title":"Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego, California, USA, June 9\u201312, 2003","first-page":"76","article-title":"Winnowing: local algorithms for document fingerprinting","author":"Schleimer","year":"2003"},{"issue":"18","key":"10.1016\/j.tcs.2026.115932_bib0002","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1093\/bioinformatics\/bth408","article-title":"Reducing storage requirements for biological sequence comparison","volume":"20","author":"Roberts","year":"2004","journal-title":"Bioinform."},{"issue":"14","key":"10.1016\/j.tcs.2026.115932_bib0003","doi-asserted-by":"crossref","first-page":"2103","DOI":"10.1093\/bioinformatics\/btw152","article-title":"Minimap and miniasm: fast mapping and de novo assembly for noisy long sequences","volume":"32","author":"Li","year":"2016","journal-title":"Bioinform."},{"issue":"18","key":"10.1016\/j.tcs.2026.115932_bib0004","doi-asserted-by":"crossref","first-page":"3094","DOI":"10.1093\/bioinformatics\/bty191","article-title":"Minimap2: pairwise alignment for nucleotide sequences","volume":"34","author":"Li","year":"2018","journal-title":"Bioinform."},{"issue":"3","key":"10.1016\/j.tcs.2026.115932_bib0005","doi-asserted-by":"crossref","DOI":"10.1186\/gb-2014-15-3-r46","article-title":"Kraken: ultrafast metagenomic sequence classification using exact alignments","volume":"15","author":"Wood","year":"2014","journal-title":"Genome Biol."},{"issue":"12","key":"10.1016\/j.tcs.2026.115932_bib0006","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1089\/cmb.2023.0094","article-title":"Creating and using minimizer sketches in computational genomics","volume":"30","author":"Zheng","year":"2023","journal-title":"J. Comput. Biol."},{"issue":"11","key":"10.1016\/j.tcs.2026.115932_bib0007","doi-asserted-by":"crossref","first-page":"1755","DOI":"10.1002\/spe.2481","article-title":"Sampled suffix array with minimizers","volume":"47","author":"Grabowski","year":"2017","journal-title":"Softw. Pract. Exp."},{"issue":"1","key":"10.1016\/j.tcs.2026.115932_bib0008","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1186\/s13015-022-00212-0","article-title":"Space-efficient representation of genomic k-mer count tables","volume":"17","author":"Shibuya","year":"2022","journal-title":"Algorithms Mol. Biol."},{"issue":"11","key":"10.1016\/j.tcs.2026.115932_bib0009","doi-asserted-by":"crossref","first-page":"11093","DOI":"10.1109\/TKDE.2022.3231780","article-title":"Bidirectional string anchors for improved text indexing and top-$k$ similarity search","volume":"35","author":"Loukides","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"9","key":"10.1016\/j.tcs.2026.115932_bib0010","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.14778\/3598581.3598586","article-title":"Text indexing for long patterns: anchors are all you need","volume":"16","author":"Ayad","year":"2023","journal-title":"Proc. VLDB Endow."},{"issue":"5","key":"10.1016\/j.tcs.2026.115932_bib0011","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1089\/cmb.2014.0160","article-title":"On the representation of De Bruijn graphs","volume":"22","author":"Chikhi","year":"2015","journal-title":"J. Comput. Biol."},{"issue":"10","key":"10.1016\/j.tcs.2026.115932_bib0012","doi-asserted-by":"crossref","first-page":"1569","DOI":"10.1093\/bioinformatics\/btv022","article-title":"KMC 2: fast and resource-frugal k-mer counting","volume":"31","author":"Deorowicz","year":"2015","journal-title":"Bioinform."},{"key":"10.1016\/j.tcs.2026.115932_bib0013","series-title":"Algorithms in Bioinformatics - 16th International Workshop, WABI 2016, Aarhus, Denmark, August 22\u201324, 2016. Proceedings","first-page":"257","article-title":"Compact universal k-mer hitting sets","volume":"9838","author":"Orenstein","year":"2016"},{"issue":"Supplement-1","key":"10.1016\/j.tcs.2026.115932_bib0014","doi-asserted-by":"crossref","first-page":"i119","DOI":"10.1093\/bioinformatics\/btaa472","article-title":"Improved design and analysis of practical minimizers","volume":"36","author":"Zheng","year":"2020","journal-title":"Bioinform."},{"issue":"Supplement-1","key":"10.1016\/j.tcs.2026.115932_bib0015","doi-asserted-by":"crossref","first-page":"i111","DOI":"10.1093\/bioinformatics\/btaa435","article-title":"Weighted minimizer sampling improves long read mapping","volume":"36","author":"Jain","year":"2020","journal-title":"Bioinform."},{"issue":"Supplement","key":"10.1016\/j.tcs.2026.115932_bib0016","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1093\/bioinformatics\/btab313","article-title":"Sequence-specific minimizers via polar sets","volume":"37","author":"Zheng","year":"2021","journal-title":"Bioinform."},{"issue":"12","key":"10.1016\/j.tcs.2026.115932_bib0017","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1089\/cmb.2022.0275","article-title":"Differentiable learning of sequence-specific minimizer schemes with deepminimizer","volume":"29","author":"Hoang","year":"2022","journal-title":"J. Comput. Biol."},{"key":"10.1016\/j.tcs.2026.115932_bib0018","series-title":"Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20\u201322, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.tcs.2026.115932_bib0019","series-title":"29th Annual European Symposium on Algorithms, ESA 2021, September 6\u20138, 2021, Lisbon, Portugal (Virtual Conference)","first-page":"64:1","article-title":"Bidirectional string anchors: a new string sampling mechanism","volume":"204","author":"Loukides","year":"2021"},{"key":"10.1016\/j.tcs.2026.115932_bib0020","series-title":"28th Annual European Symposium on Algorithms, ESA 2020, September 7\u20139, 2020, Pisa, Italy (Virtual Conference)","first-page":"15:1","article-title":"On the complexity of BWT-Runs minimization via alphabet reordering","volume":"173","author":"Bentley","year":"2020"},{"key":"10.1016\/j.tcs.2026.115932_bib0021","series-title":"38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16\u201319, 2021, Saarbr\u00dcCken, Germany (Virtual Conference)","first-page":"35:1","article-title":"Finding an optimal alphabet ordering for lyndon factorization is hard","volume":"187","author":"Gibney","year":"2021"},{"key":"10.1016\/j.tcs.2026.115932_bib0022","series-title":"35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, June 25\u201327, 2024, Fukuoka, Japan","first-page":"28:1","article-title":"Minimizing the minimizers via alphabet reordering","volume":"296","author":"Verbeek","year":"2024"},{"issue":"2","key":"10.1016\/j.tcs.2026.115932_bib0023","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/TCT.1963.1082116","article-title":"Minimum feedback arc sets for a directed graph","volume":"10","author":"Younger","year":"1963","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/j.tcs.2026.115932_bib0024","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s00026-015-0266-9","article-title":"Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs","volume":"19","author":"Perrot","year":"2015","journal-title":"Ann. Comb."},{"issue":"2","key":"10.1016\/j.tcs.2026.115932_bib0025","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","article-title":"Efficient randomized pattern-matching algorithms","volume":"31","author":"Karp","year":"1987","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/j.tcs.2026.115932_bib0026","article-title":"On the number of k-mers admitting a given lexicographical minimizer","author":"Ingels","year":"2024","journal-title":"CoRR"},{"key":"10.1016\/j.tcs.2026.115932_bib0027","series-title":"24th International Workshop on Algorithms in Bioinformatics (WABI 2024)","first-page":"11:1","article-title":"The mod-minimizer: a simple and efficient sampling algorithm for long k-mers","volume":"312","author":"Groot Koerkamp","year":"2024"},{"issue":"13","key":"10.1016\/j.tcs.2026.115932_bib0028","doi-asserted-by":"crossref","first-page":"i13","DOI":"10.1093\/bioinformatics\/bty258","article-title":"Asymptotically optimal minimizers schemes","volume":"34","author":"Mar\u00e7ais","year":"2018","journal-title":"Bioinformatics"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600191X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600191X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T03:23:15Z","timestamp":1778815395000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439752600191X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":28,"alternative-id":["S030439752600191X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115932","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Minimizing the minimizers via alphabet reordering","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115932","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115932"}}