Results 11 to 20 of about 39,701 (283)
Converting suffix trees into factor/suffix oracles [PDF]
Several methods to compress suffix trees were defined, most of them with the aim of obtaining compact (that is, space economical) index structures. Besides this practical aspect, a compression method can reveal structural properties of the resulting data structure, allowing a better understanding of it and a better estimation of its performances.
Rusu, Irena
openaire +5 more sources
Faster suffix tree construction with missing suffix links [PDF]
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
core +5 more sources
Functional variants of nouns with the suffix -ush-/-yush- in modern Russian language
The object of research in this work is derived nouns with the suffix -ush-/-yush- (-уш-/-юш-). The relevance of the study is determined by the fact that this suffix has been insufficiently studied, probably because it is productive mainly in speaking and
E.A. Makleeva
doaj +1 more source
Analysis of Suffix Use for Biosimilar Product Identification in Postmarketing Adverse Event Reporting. [PDF]
Accurate identification of medicines used in adverse event reports is crucial for effective postmarketing safety surveillance. The US Food and Drug Administration's (FDA) four‐letter suffix naming convention was designed to facilitate accurate biological product identification, but the extent to which these suffixes have been incorporated into ...
Stojanovic D +3 more
europepmc +2 more sources
The suffix binary search tree and suffix AVL tree
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 online string searching ...
Love, L., Irving, R.
core +9 more sources
Converting Suffix Trees into Factor/Suffix Oracles [PDF]
The factor/suffix oracle is an automaton introduced by Allauzen, Crochemore and Raffinot. It is built for a given sequence s on an alphabet , and it weakly recognizes all the factors (the suffixes, respectively) of s : that is, it certainly recognizes ...
Rusu, Irena
core +9 more sources
RECONSTRUCTING A SUFFIX ARRAY [PDF]
For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a suffix tree or suffix array should occur in lexicographical order (lexorder). It thus becomes of interest to study possible alternate orderings of the suffixes in these data structures,
Franěk, F., Smyth, W.F.
openaire +3 more sources
On Suffix Extensions in Suffix Trees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Breslauer D, Italiano G
openaire +8 more sources
Code for the article "New methods for analysing diachronic suffix competition across registers"
This repository contains source code connected to the following article: Rodríguez-Puente, Paula, Tanja Säily and Jukka Suomela. "New methods for analysing diachronic suffix competition across registers: How -ity gained ground on -ness in Early Modern ...
Jukka Suomela
core +1 more source
Identification of novel neutralizing determinants for protection against HCV
Identification of novel neutralizing determinants for protection against hepatitis C virus. Abstract Background and Aims HCV evasion of neutralizing antibodies (nAb) results in viral persistence and poses challenges to the development of an urgently needed vaccine.
Garazi P. Alzua +12 more
wiley +1 more source

