METHODS article
Front. Bioinform.
Sec. Integrative Bioinformatics
Volume 5 - 2025 | doi: 10.3389/fbinf.2025.1577324
This article is part of the Research TopicInnovative Tools for Multi-Omics Data AnalysisView all articles
A Novel Linear Indexing for Strings under all Internal Nodes in a Suffix Tree
Provisionally accepted
Anas Al-okaily1*
Abdelghani Tbakhi2- 1King Hussein Cancer Center, Amman, Jordan
- 2McMaster University, Hamilton, Ontario, Canada
Select one of your emails
You have multiple emails registered with Frontiers:
Notify me on publication
Please enter your email address:
If you already have an account, please login
You don't have a Frontiers account ? You can register here
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 across several areas, including DNA sequence analysis and approximate pattern matching.
Keywords: Suffix trees, Strings Indexing, Approximate Patten Matching, reads alignment, Motif search
Received: 15 Feb 2025; Accepted: 07 Aug 2025.
Copyright: © 2025 Al-okaily and Tbakhi. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
* Correspondence: Anas Al-okaily, King Hussein Cancer Center, Amman, Jordan
Disclaimer: All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.