Results 71 to 80 of about 38,188 (290)
Approximate Online Pattern Matching in Sub-linear Time
CoRR, 2018 We consider the approximate pattern matching problem under edit distance. In this problem we are given a pattern $P$ of length $w$ and a text $T$ of length $n$ over some alphabet $Σ$, and a positive integer $k$. The goal is to find all the positions $j$ in $T$ such that there is a substring of $T$ ending at $j$ which has edit distance at most $k$ from ...
Diptarka Chakraborty +2 more
openaire +4 more sources
FEBS Letters, EarlyView.An unexpected alternative interaction site for ethyl viologen was identified in formate dehydrogenase 1 from Methylorubrum extorquens. Combined mutagenesis, kinetic analysis, and docking revealed that aromatic residues near an iron–sulfur cluster enable flavin mononucleotide‐independent electron transfer, offering a framework for engineering improved ...
Eleni G. Poloniataki, Yong Hwan Kim
wiley +1 more source
Faster Approximate Elastic-Degenerate String Matching - Part B [PDF]
We revisit the complexity of approximate pattern matching in an elastic-degenerate string. Such a string is a sequence of n finite sets of strings of total length N, and compactly describes a collection of strings obtained by first choosing exactly one ...
Pissis, Solon P. +10 more
core +1 more source
Approximating Text-To-Pattern Distance via Dimensionality Reduction [PDF]
, 2020 Text-to-pattern distance is a fundamental problem in string matching, where given a pattern of length m and a text of length n, over an integer alphabet, we are asked to compute the distance between pattern and the text at every location.
Uznański, Przemysław
core +1 more source
Approximate pattern matching and transitive closure logics
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kjell Lemström, Lauri Hella
openaire +2 more sources
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Algorithms for Molecular Biology, 2012 Background Chaos Game Representation (CGR) is an iterated function that bijectively maps discrete sequences into a continuous domain. As a result, discrete sequences can be object of statistical and topological analyses otherwise reserved to numerical ...
Vinga Susana +4 more
doaj +1 more source
Improved Approximation Bounds for Planar Point Pattern Matching [PDF]
Algorithmica, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Minkyoung Cho, David M. Mount
openaire +2 more sources
Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis
FEBS Letters, EarlyView.Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee +7 more
wiley +1 more source
Compressed indexes for approximate string matching
, 2010 We revisit the problem of indexing a string S[1..n] to support finding all substrings in S that match a given pattern P[1..m] with at most k errors. Previous solutions either require an index of size exponential in k or need Ω(m k ) time for searching ...
Lam, T.-W. +9 more
core +1 more source