Results 41 to 50 of about 58,956 (207)
INVESTIGAÇÃO HISTÓRICA DO SUFIXO –“EIR”- NA NOMEAÇÃO DE VEGETAIS EM LÍNGUA PORTUGUESA
Studia Universitatis Babeş-Bolyai. Philologia, 2021 A Historical Investigation of the Suffix -eir- for the Naming of Plants in the Portuguese Language. The Latin suffix -ari-, used as a creator of adjectives, developed several meanings during the period of spoken late Latin, as well as in the formation ...
Natival SIMÕES NETO +1 more
doaj +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
Storage and retrieval of individual genomes [PDF]
, 2009 Volume: 5541A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N.
D. Gusfield +15 more
core +5 more sources
PFP Compressed Suffix Trees [PDF]
, 2021 Prefix-free parsing (PFP) was introduced by Boucher et al. (2019) as a preprocessing step to ease the computation of Burrows-Wheeler Transforms (BWTs) of genomic databases. Given a string S, it produces a dictionary D and a parse P of overlapping phrases such that BWT(S) can be computed from D and P in time and workspace bounded in terms of their ...
Boucher C. +6 more
openaire +2 more sources
Storage and Retrieval of Individual Genomes [PDF]
, 2008 A repetitive sequence collection is one where portions of a emph{base sequence} of length $n$ are repeated many times with small variations, forming a collection of total length $N$.
, Navarro, Gonzalo
core +1 more source
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
Cross-Document Pattern Matching [PDF]
, 2012 We study a new variant of the string matching problem called cross-document string matching, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern itself is a ...
A. Andersson +14 more
core +7 more sources
A Minimal Periods Algorithm with Applications [PDF]
, 2009 Kosaraju in ``Computation of squares in a string'' briefly described a linear-time algorithm for computing the minimal squares starting at each position in a word.
A. Apostolico +20 more
core +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