Results 51 to 60 of about 37,210 (201)
Optimal Substring-Equality Queries with Applications to Sparse Text Indexing
We consider the problem of encoding a string of length $n$ from an integer alphabet of size $\sigma$ so that access and substring equality queries (that is, determining the equality of any two substrings) can be answered efficiently.
Prezza, Nicola
core +1 more source
The de-identification of clinical reports is essential to protect the confidentiality of patients. The natural-language-processing-based named entity recognition (NER) model is a widely used technique of automatic clinical de-identification.
Tanmoy Paul +11 more
doaj +1 more source
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search [PDF]
Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related species.
Beller, Timo, Ohlebusch, Enno
core +2 more sources
A New Strategy to Design Reconfigurable Rivest–Shamir–Adleman (RSA) Accelerators
A reconfigurable FPGA‐based RSA accelerator is proposed using compression‐based modular multipliers combined with pseudomoduli arithmetic. The approach maps modular exponentiation to low‐cost arithmetic domains and applies a correction stage, achieving significant improvements in delay, operating frequency, and delay–area efficiency compared with ...
Augusto C. B. Vassoler +4 more
wiley +1 more source
Gclust: A Parallel Clustering Tool for Microbial Genomic Data
The accelerating growth of the public microbial genomic data imposes substantial burden on the research community that uses such resources. Building databases for non-redundant reference sequences from massive microbial genomic data based on clustering ...
Ruilin Li +17 more
doaj +1 more source
Lightweight LCP Construction for Very Large Collections of Strings
The longest common prefix array is a very advantageous data structure that, combined with the suffix array and the Burrows-Wheeler transform, allows to efficiently compute some combinatorial properties of a string useful in several applications ...
Cox, Anthony J. +3 more
core +1 more source
Cross-Document Pattern Matching [PDF]
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
Smaller Compressed Suffix Arrays†
AbstractAn alternative to compressed suffix arrays is introduced, based on representing a sequence of integers using Fibonacci encodings, thereby reducing the space requirements of state-of-the-art implementations of the suffix array, while retaining the searching functionalities.
Ekaterina Benza +2 more
openaire +1 more source
Integrating crop phenology and sclerotia germination models into SkleroPro improved Sclerotinia risk prediction accuracy from 34% to 66%, optimizing fungicide timing and supporting sustainable winter rapeseed production. Abstract BACKGROUND Sclerotinia stem rot, caused by Sclerotinia sclerotiorum, threatens winter rapeseed (Brassica napus) production ...
Vera Krause +4 more
wiley +1 more source
Replacing suffix trees with enhanced suffix arrays
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohamed Ibrahim Abouelhoda +2 more
openaire +1 more source

