{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T02:06:00Z","timestamp":1772244360969,"version":"3.50.1"},"reference-count":19,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T00:00:00Z","timestamp":1756944000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Bioinform."],"abstract":"<jats:p>Suffix trees are fundamental data structures in stringology and have wide applications across various domains. In this work, we propose two linear-time algorithms for indexing strings under each internal node in a suffix tree while preserving the ability to track similarities and redundancies across different internal nodes. This is achieved through a novel tree structure derived from the suffix tree, along with new indexing concepts. The resulting indexes offer practical solutions in several areas, including DNA sequence analysis and approximate pattern matching.<\/jats:p>","DOI":"10.3389\/fbinf.2025.1577324","type":"journal-article","created":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T05:33:24Z","timestamp":1756964004000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A novel linear indexing method for strings under all internal nodes in a suffix tree"],"prefix":"10.3389","volume":"5","author":[{"given":"Anas","family":"Al-okaily","sequence":"first","affiliation":[]},{"given":"Abdelghani","family":"Tbakhi","sequence":"additional","affiliation":[]}],"member":"1965","published-online":{"date-parts":[[2025,9,4]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/s1570-8667(03)00065-0","article-title":"Replacing suffix trees with enhanced suffix arrays","volume":"2","author":"Abouelhoda","year":"2004","journal-title":"J. discrete algorithms"},{"key":"B2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-27848-8_627-1","article-title":"Suffix trees and arrays","author":"Apostolico","year":"2014","journal-title":"J. Encycl. Algorithms"},{"key":"B3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3381417","article-title":"Linear-time string indexing and analysis in small space","volume":"16","author":"Belazzougui","year":"2020","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"B4","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1109\/SFCS.2000.892127","article-title":"Opportunistic data structures with applications","volume-title":"Proceedings 41st annual symposium on foundations of computer science","author":"Ferragina","year":"2000"},{"key":"B5","doi-asserted-by":"publisher","first-page":"bbad512","DOI":"10.1093\/bib\/bbad512","article-title":"Deep neural network learning biological condition information refines gene-expression-based cell subtypes","volume":"25","author":"Guo","year":"2024","journal-title":"Briefings Bioinforma."},{"key":"B6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1186\/s13059-024-03252-4","article-title":"NextDenovo: an efficient error correction and accurate assembly tool for noisy long reads","volume":"25","author":"Hu","year":"2024","journal-title":"Genome Biol."},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1303.3997","article-title":"Aligning sequence reads, clone sequences and assembly contigs with bwa-mem","author":"Li","year":"2013","journal-title":"arXiv"},{"key":"B8","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM (JACM)"},{"key":"B9","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.jda.2015.01.005","article-title":"A suffix tree or not a suffix tree?","volume":"32","author":"Starikovskaya","year":"2015","journal-title":"J. Discrete Algorithms"},{"key":"B10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/bf01206331","article-title":"On-line construction of suffix trees","volume":"14","author":"Ukkonen","year":"1995","journal-title":"Algorithmica"},{"key":"B11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1186\/s12859-024-05964-7","article-title":"Mippis: protein\u2013protein interaction site prediction network with multi-information fusion","volume":"25","author":"Wang","year":"","journal-title":"BMC Bioinforma."},{"key":"B12","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1186\/s40246-024-00666-w","article-title":"Fast and accurate dnaseq variant calling workflow composed of lush toolkit","volume":"18","author":"Wang","year":"","journal-title":"Hum. Genomics"},{"key":"B13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/SWAT.1973.13","article-title":"Linear pattern matching algorithms","volume-title":"14th annual symposium on Switching and Automata Theory (swat 1973)","author":"Weiner","year":"1973"},{"key":"B14","volume-title":"Counting patterns in strings and graphs","author":"Wellnitz","year":"2021"},{"key":"B15","doi-asserted-by":"publisher","first-page":"13727","DOI":"10.1039\/d4sc03744h","article-title":"3dsmiles-gpt: 3d molecular pocket-based generation with token-only large language model","volume":"15","author":"Yue","year":"","journal-title":"Chem. Sci."},{"key":"B16","doi-asserted-by":"publisher","first-page":"13727","DOI":"10.1039\/D4SC03744H","article-title":"Unlocking comprehensive molecular design across all scenarios with large language model and unordered chemical language","volume":"15","author":"Yue","year":"","journal-title":"Chem. Sci."},{"key":"B17","doi-asserted-by":"publisher","first-page":"bbac384","DOI":"10.1093\/bib\/bbac384","article-title":"A geometric deep learning framework for drug repositioning over heterogeneous information networks","volume":"23","author":"Zhao","year":"2022","journal-title":"Briefings Bioinforma."},{"key":"B18","doi-asserted-by":"publisher","first-page":"2924","DOI":"10.1016\/j.csbj.2024.06.032","article-title":"A heterogeneous information network learning model with neighborhood-level structural representation for predicting lncrna\u2013mirna interactions","volume":"22","author":"Zhao","year":"2024","journal-title":"Comput. Struct. Biotechnol. J."},{"key":"B19","doi-asserted-by":"publisher","first-page":"121360","DOI":"10.1016\/j.ins.2024.121360","article-title":"Regulation-aware graph learning for drug repositioning over heterogeneous biological network","volume":"686","author":"Zhao","year":"2025","journal-title":"Inf. Sci."}],"container-title":["Frontiers in Bioinformatics"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fbinf.2025.1577324\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T05:33:26Z","timestamp":1756964006000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fbinf.2025.1577324\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,4]]},"references-count":19,"alternative-id":["10.3389\/fbinf.2025.1577324"],"URL":"https:\/\/doi.org\/10.3389\/fbinf.2025.1577324","relation":{"has-preprint":[{"id-type":"doi","id":"10.1101\/2021.10.25.465764","asserted-by":"object"}]},"ISSN":["2673-7647"],"issn-type":[{"value":"2673-7647","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,4]]},"article-number":"1577324"}}