Results 91 to 100 of about 319,166 (311)
k-Abelian pattern matching [PDF]
Journal of Discrete Algorithms, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thorsten Ehlers +3 more
openaire +2 more sources
Degradation mechanism of the von Willebrand factor A2 domain by nattokinase
FEBS Letters, EarlyView.Nattokinase, a natto‐derived protease, exhibits potent antithrombotic effects. This study demonstrates that nattokinase directly cleaves the von Willebrand factor (vWF) A2 domain in vitro. Unlike the native regulator ADAMTS13, nattokinase degrades folded vWF independently of shear stress.
Ryuichi Hyakumoto +3 more
wiley +1 more source
Towards Building a Uniform Cloud Database Representation for Data Interchange
Annals of the West University of Timisoara: Mathematics and Computer Science, 2016 The paper proposes design principles for data representation and simplification in order to design cloud services for data exchange between various information systems. We use equivalence algorithms and canonical representation in the cloud database. The
Andreica Alina
doaj +1 more source
Pattern Matching for Sets of Segments [PDF]
Algorithmica, 2004 In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of two main parts. In the first, we address problems and measures that relate to collections of orthogonal line segments in the plane.
Alon Efrat +2 more
openaire +3 more sources
Modulation of Homer1 EVH1 domain internal dynamics by putative autism‐associated mutations
FEBS Letters, EarlyView.The putative autism‐associated M65I and S97L variants of the EVH1 domain of the postsynaptic scaffold protein Homer1 do not exhibit substantial changes in their overall structure or partner binding. Both of them, but especially the M65I variant, show altered internal dynamics relative to the wild‐type domain on the μs‐ms timescale, indicated by the ...
Fanni Farkas +6 more
wiley +1 more source
Communication and Streaming Complexity of Approximate Pattern Matching [PDF]
, 2017 We consider the approximate pattern matching problem. Given a text T of length 2n and a pattern P of length n, the task is to decide for each prefix T[1, j] of T if it ends with a string that is at the edit distance at most k from P. If this is the case,
Starikovskaya, Tatiana
core +1 more source
Matching Patterns with Variables [PDF]
, 2019 A pattern p (i.e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of p by terminal words. The respective matching problem, i.e., deciding whether or not a given pattern matches a given word, is generally NP-complete, but can be solved in polynomial-time for classes of patterns with ...
Florin Manea, Markus L. Schmid
openaire +2 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
Online Abelian Pattern Matching
, 2008 Ejaz T, Rahmann S, Stoye J. Online Abelian Pattern Matching. Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik / Universität Bielefeld.
Ejaz, Tahir +2 more
core
Pattern Matching on Run-Length Grammar-Compressed Strings in Linear Time [PDF]
Run-length straight-line programs (RLSLPs) are a technique for grammar-based compression, allowing any string to be represented with optimal space for δ, the substring complexity of the string.
Shinohara, Ayumi +2 more
core +1 more source