Results 41 to 50 of about 58,659 (213)
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
Optimal Prefix and Suffix Queries on Texts [PDF]
, 2008 International audienceIn this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied by Makinen and Navarro [V. Makinen, G. Navarro, Position-restricted substring searching, in: J.R.
Crochemore, Maxime +2 more
core +4 more sources
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
Faster suffix tree construction with missing suffix links [PDF]
Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000 Summary: We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees for two-dimensional arrays. These trees also have the property that the node degrees may be large.
Cole, Richard, Hariharan, Ramesh
openaire +3 more sources
Representing the Suffix Tree with the CDAWG [PDF]
, 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_REV(T)) words of space, where REV(T) is the reverse of T, and supporting some key operations
Belazzougui, Djamal, Cunial, Fabio
core +2 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
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
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
, 2013 This paper presents a general technique for optimally transforming any dynamic data structure that operates on atomic and indivisible keys by constant-time comparisons, into a data structure that handles unbounded-length keys whose comparison cost is not
Amir, Amihood +5 more
core +1 more source