Results 41 to 50 of about 6,253 (207)
The suffix binary search tree and suffix AVL tree [PDF]
, 2000 Suffix trees and suffix arrays are classical data structures that are used to represent the set of suffixes of a given string, and thereby facilitate the efficient solution of various string processing problems-- in particular on-line string searching ...
Department Computing Science +2 more
core +2 more sources
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
Weighted Ancestors in Suffix Trees [PDF]
, 2014 The classical, ubiquitous, predecessor problem is to construct a data structure for a set of integers that supports fast predecessor queries. Its generalization to weighted trees, a.k.a. the weighted ancestor problem, has been extensively explored and successfully reduced to the predecessor problem.
Gawrychowski, P. +2 more
openaire +3 more sources
Suffix Tree Construction [PDF]
, 2014 Stoye J. Suffix Tree Construction. In: Kao M-Y, ed. Encyclopedia of Algorithms.
Kao, M.-Y. +1 more
core +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
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
Fast Hybrid Data Structure for a Large Alphabet K-Mers Indexing for Whole Genome Alignment
IEEE Access, 2021 The most common index data structures used by whole genome aligners (WGA) are based on suffix trees (ST), suffix arrays, and FM-indexes. These data structures show good performance results as WGA works with sequences of letters over small alphabets; for ...
Rostislav Hrivnak +2 more
doaj +1 more source
European Journal of Inorganic Chemistry, EarlyView.Hydrothermal and microwave‐assisted syntheses enable systematic tuning of ceria nanostructure morphology. Chloride counter‐ions direct nanorod growth, while an acetate buffer yields uniform nanocubes whose size (14–26 nm) is tuned via the reactor filling ratio, with microwave heating significantly cutting reaction times to minutes while preserving high
Omar Bettini +7 more
wiley +1 more source
A Branch‐and‐Price Algorithm for the Symmetric Electric Traveling Salesman Problem
Networks, EarlyView.ABSTRACT The Electric Traveling Salesman Problem (ETSP) is a variant of the well‐known TSP in which an electric vehicle must visit a set of customers minimizing the total cost of its route. The vehicle is assumed to be equipped with a battery of limited capacity that may need to be recharged along the route.
Alberto Ceselli +2 more
wiley +1 more source
Optimal Logarithmic Time Randomized Suffix Tree Construction [PDF]
, 1996 The suffix tree of a string, the fundamental data structure in the area of combinatorial pattern matching, has many elegant applications. In this paper, we present a novel, simple sequential algorithm for the construction of suffix trees.
Martin Farach, S. Muthukrishnan
core +1 more source