Results 11 to 20 of about 40,634 (160)
Intent Arabic text categorisation based on different machine learning and term frequency
IET Networks, EarlyView., 2022 Abstract The complexity of Internet network configurations has made managing networks a complicated undertaking. Intent‐Based Networking (IBN) is a potential solution to this issue. In contrast to conventional networks, where a concrete description of the settings typically conveys a network administrator's goal kept on each device, an administrator's ...
Mohammad Fadhil Mahdi +1 more
wiley +1 more source
Practical Compressed Suffix Trees
Algorithms, 2013 The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for
Gonzalo Navarro +2 more
doaj +1 more source
Wavelet Trees Meet Suffix Trees [PDF]
, 2015 We present an improved wavelet tree construction algorithm and discuss its applications to a number of rank/select problems for integer keys and strings.
Babenko, Maxim +3 more
core +1 more source
The FORGENIUS Genomic Resources: New Genotyping Tools and Genomic Data for 23 Forest Tree Species and Their Genetic Conservation Units. [PDF]
Mol Ecol ResourABSTRACT Genetic diversity is a critical but often overlooked component of biological diversity. The European H2020 FORGENIUS project is aimed at increasing the quality and quantity of genetic data to start monitoring the European network of forest Genetic Conservation Units (GCUs).
Pinosio S +14 more
europepmc +2 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.
D.E. Willard +6 more
core +1 more source
On-line construction of position heaps [PDF]
, 2011 We propose a simple linear-time on-line algorithm for constructing a position heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap differs slightly from the one proposed in [Ehrenfeucht et al, 2011] in that it considers the ...
A. Blumer +10 more
core +8 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
Suffix-Sorting via Shannon-Fano-Elias Codes
Algorithms, 2010 Given a sequence T = t0t1 . . . tn-1 of size n = |T|, with symbols from a fixed alphabet Σ, (|Σ| ≤ n), the suffix array provides a listing of all the suffixes of T in a lexicographic order.
Donald Adjeroh, Fei Nan
doaj +1 more source
A suffix tree or not a suffix tree? [PDF]
, 2014 In this paper we study the structure of suffix trees. Given an unlabeled tree τ on n nodes and suffix links of its internal nodes, we ask the question ”Is τ a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure ...
A Apostolico +17 more
core +6 more sources
Subpath Queries on Compressed Graphs: A Survey
Algorithms, 2021 Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text T, pre-process it off-line so that, later, we can quickly count and locate the occurrences of any string (the query pattern) in T in time ...
Nicola Prezza
doaj +1 more source