Results 141 to 150 of about 37,020 (188)

b-move: faster lossless approximate pattern matching in a run-length compressed index. [PDF]

Algorithms Mol Biol
Depuydt L, Renders L, Van de Vyver S, Veys L, Gagie T, Fostier J.   +5 more
europepmc   +1 more source

Formal verification of bioinformatics software using model checking and theorem proving. [PDF]

Brief Bioinform
Weerasena H, Jayasena A, Boucher C, Mishra P.   +3 more
europepmc   +1 more source

A multi-dimensional DNS domain intelligence dataset for cybersecurity research. [PDF]

Data Brief
Hranický R, Ondryáš O, Horák A, Pouč P, Jeřábek K, Ebert T, Polišenský J.   +6 more
europepmc   +1 more source

PLA-index: A <i>k</i>-mer Index Exploiting Rank Curve Linearity. [PDF]

Algorithms Bioinform
Abrar H, Medvedev P.
europepmc   +1 more source

Role of atomic force microscopy in characterization of heterotypic cancer spheroids and their interaction with microplastic particles. [PDF]

Sci Rep
Kolesnik T, Öhlinger K, Absenger-Novak M, Meindl C, Fröhlich E.   +4 more
europepmc   +1 more source

PS3N: leveraging protein sequence-structure similarity for novel drug-drug interaction discovery. [PDF]

Sci Rep
Islam S, Abbasi A, Agarwal N, Zheng W, Doretto G, Adjeroh DA.   +5 more
europepmc   +1 more source

Dataset of Uzbek verbs with formation and suffixes. [PDF]

Data Brief
Sharipov M, Vičič J.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Computing Quasi Suffix Arrays

2003
We introduce quasi suffix arrays as a generalization of suffix arrays for character strings. We show that a quasi suffix array encodes enough of the structure of the string to be a useful construct for many applications where the full power of suffix arrays is not necessary, notably in problems that do not require lexicographical order, for example ...
Franěk, František, Holub, Jan, Smyth, William F., Xiao, Xiangdong   +3 more
openaire   +2 more sources

Dynamic Generalized Suffix Arrays

Applied Mechanics and Materials, 2012
Document retrieval is the basic task of search engines, and seize amount of attention by the pattern matching community. In this paper, we focused on the dynamic version of this problem, in which the text insertion and deletion is allowable. By using the generalized suffix array and other data structure, we proposed a new index structure.
Song Feng Lu, Hua Zhao
openaire   +1 more source

DCA Using Suffix Arrays

Data Compression Conference (dcc 2008), 2008
DCA (Data Compression using Antidictionaries) is a novel lossless data compression method working on bit streams presented by Crochemore et al. DCA takes advantage of words that do not occur as factors in the text, i.e. that are forbidden. Due to these forbidden words (antiwords), some symbols in the text can be predicted.
Martin Fiala, Jan Holub
openaire   +1 more source