Results 41 to 50 of about 3,800 (211)
Analyzing State Sequences with Probabilistic Suffix Trees: The PST R Package
Journal of Statistical Software, 2016 This article presents the PST R package for categorical sequence analysis with probabilistic suffix trees (PSTs), i.e., structures that store variable-length Markov chains (VLMCs).
Alexis Gabadinho, Gilbert Ritschard
doaj +1 more source
Representing the suffix tree with the CDAWG
CoRR, 2017 Given a string $T$, it is known that its suffix tree can be represented using the compact directed acyclic word graph (CDAWG) with $e_T$ arcs, taking overall $O(e_T+e_{\overline{T}})$ words of space, where ${\overline{T}}$ is the reverse of $T$, and supporting some key operations in time between $O(1)$ and $O(\log{\log{n}})$ in the worst case.
Belazzougui, Djamal, Cunial, Fabio
openaire +4 more sources
Faster repetition-aware compressed suffix trees based on Block Trees [PDF]
, 2022 The suffix tree is a fundamental data structure in stringology, but its space usage, though linear, is an important problem in applications like Bioinformatics.
Caceres Reyes, Manuel Ariel +1 more
core +1 more source
Construction of distributed suffix trees
Технічна інженеріяThe paper addresses the problem of parallel suffix tree construction over large text arrays without the use of cluster infrastructure. The evolution of relevant algorithms is analysed – from the single-threaded methods of Weiner, McCreight, and Ukkonen ...
D.V. Zvazhii, O.M. Malii
doaj +1 more source
Structure and Sequence Aligned Code Summarization with Prefix and Suffix Balanced Strategy
Entropy, 2023 Source code summarization focuses on generating qualified natural language descriptions of a code snippet (e.g., functionality, usage and version). In an actual development environment, descriptions of the code are missing or not consistent with the code
Jianhui Zeng, Zhiheng Qu, Bo Cai
doaj +1 more source
Doubts on Irish Iubhar 'Yew Tree' and Eburacum or York [PDF]
Вопросы ономастики, 2019 York, a cathedral city in the north of England, was the Eburacum or Colonia Eburacensis of Roman Britain. Its name has usually been explained from Irish iubhar ‘yew tree’ (or alternatively from Welsh efwr ‘hogweed’) and so ‘place where yew trees grow ...
Andrew Breeze
doaj +1 more source
BuST-Bundled Suffix Trees [PDF]
, 2006 We introduce a data structure, the Bundled Suffix Tree (BUST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet Σ together with a non-transitive relation ≈ among its letters. Following the path of a substring β within a BUST, constructed over a text α of length n, not only the positions of the exact occurrences of β in
Luca Bortolussi +2 more
openaire +2 more sources
Suffix trees for very large genomic sequences [PDF]
, 2009 A suffix tree is a fundamental data structure for string search-ing algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current methods for constructing suffix trees do not scale for large inputs.
Chris Upton +3 more
core +1 more source
Linear-Time Text Compression by Longest-First Substitution
Algorithms, 2009 We consider grammar-based text compression with longest first substitution (LFS), where non-overlapping occurrences of a longest repeating factor of the input text are replaced by a new non-terminal symbol.
Ayumi Shinohara +5 more
doaj +1 more source
Compressed property suffix trees
Information and Computation, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wing-Kai Hon +3 more
openaire +2 more sources