Results 51 to 60 of about 37,020 (188)
Deterministic sub-linear space LCE data structures with efficient construction [PDF]
, 2016 Given a string $S$ of $n$ symbols, a longest common extension query $\mathsf{LCE}(i,j)$ asks for the length of the longest common prefix of the $i$th and $j$th suffixes of $S$. LCE queries have several important applications in string processing, perhaps
Bannai, Hideo +5 more
core +2 more sources
Lyndon Array Construction during Burrows-Wheeler Inversion [PDF]
, 2017 In this paper we present an algorithm to compute the Lyndon array of a string $T$ of length $n$ as a byproduct of the inversion of the Burrows-Wheeler transform of $T$.
Louza, Felipe A. +3 more
core +3 more sources
Applied Sciences, 2022 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
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings [PDF]
, 2015 We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the construction of both the suffix trie and suffix tree. Using this structure,
Rubinchik, Mikhail, Shur, Arseny M.
core +1 more source
Counting Suffix Arrays and Strings
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schürmann, Klaus-Bernd, Stoye, Jens
openaire +3 more sources
Revealing Protein–Protein Interactions Using a Graph Theory‐Augmented Deep Learning Approach
Advanced Intelligent Discovery, EarlyView.This study presents a fast, cost‐efficient approach for classifying protein–protein interactions by integrating graph‐theory parametrization with deep learning (DL). Multiscale features extracted from graph‐encoded polarized‐light microscopy (PLM) images enable accurate prediction of binding strengths.
Bahar Dadfar +5 more
wiley +1 more source
Algorithms to Compute the Lyndon Array [PDF]
, 2016 We first describe three algorithms for computing the Lyndon array that have been suggested in the literature, but for which no structured exposition has been given.
Franek, Frantisek +3 more
core +1 more source
Biological Reviews, EarlyView.ABSTRACT Oropharyngeal food processing exhibits a remarkable diversity among vertebrates, reflecting the evolution of specialised ‘processing centres’ associated with the mandibular, hyoid, and branchial arches. Although studies have detailed various food‐processing strategies and mechanisms across vertebrates, a coherent and comprehensive terminology ...
Daniel Schwarz +6 more
wiley +1 more source
Gclust: A Parallel Clustering Tool for Microbial Genomic Data
Genomics, Proteomics & Bioinformatics, 2019 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
A New Strategy to Design Reconfigurable Rivest–Shamir–Adleman (RSA) Accelerators
International Journal of Circuit Theory and Applications, EarlyView.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