Linear indexing for all strings under all internal nodes in suffix trees
preprint
OA: closed
Abstract
Suffix trees are fundamental data structure in stringology. In this work, we introduce two algorithms that index all strings/suffixes under all internal nodes in suffix tree in linear time and space. These indexes can contribute in resolving several strings problems such as DNA sequence analysis and approximate pattern matching problems.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-07-17T06:50:26.839124+00:00