Results 81 to 90 of about 889,414 (343)
Which Regular Expression Patterns are Hard to Match?
Regular expressions constitute a fundamental notion in formal language theory and are frequently used in computer science to define search patterns. A classic algorithm for these problems constructs and simulates a non-deterministic finite automaton ...
Backurs, Arturs, Indyk, Piotr
core +1 more source
Rewriting extended regular expressions
We consider an extended algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotonic operations; the latter property is crucial for some applications. We give a new complete Horn equational axiomatization of the algebra and develop some term-rewriting ...
Peter D. Mosses, Valentin M. Antimirov
openaire +3 more sources
Heart failure with preserved ejection fraction (HFpEF) accounts for half of the heart failure cases. It is characterised by microvascular dysfunction, associated with reduced pericyte coverage and diminished STAT3 expression in pericytes. Loss of STAT3 impairs pericyte adhesion, promotes senescence, and activates a pro‐fibrotic gene program.
Leah Rebecca Vanicek+15 more
wiley +1 more source
Cleaning OCR'd text with Regular Expressions
Optical Character Recognition (OCR)—the conversion of scanned images to machine-encoded text—has proven a godsend for historical research. This process allows texts to be searchable on one hand and more easily parsed and mined on the other. But we’ve all
Laura Turner O'Hara
doaj
Optimizing Regular Expressions via Rewrite-Guided Synthesis [PDF]
Regular expressions are pervasive in modern systems. Many real-world regular expressions are inefficient, sometimes to the extent that they are vulnerable to complexity-based attacks, and while much research has focused on detecting inefficient regular expressions or accelerating regular expression matching at the hardware level, we investigate ...
arxiv
We achieved cytoplasmic delivery of non‐cell‐penetrating IgGs by grafting a single functional complementarity‐determining region 1 (CDR1) from the light chain variable region (VL) of the cell‐internalizable 3D8 antibody. The engineered IgG acquired cell‐penetrating ability while maintaining antigen affinity, highlighting CDR1 grafting as a promising ...
Yerin Jeon+5 more
wiley +1 more source
A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata [PDF]
Regular expressions with shuffle operators are widely used in diverse fields of computer science. The work presented here investigates the shuffling of regular expressions and their conversion into non-deterministic finite automata.
Ajay Kumar, Anil Kumar Verma
doaj +1 more source
Ion channel function of polycystin‐2/polycystin‐1 heteromer revealed by structure‐guided mutagenesis
Mutations in polycystin‐1 (PC1) or polycystin‐2 (PC2) cause autosomal‐dominant polycystic kidney disease (ADPKD). We generated a novel gain‐of‐function PC2/PC1 heteromeric ion channel by mutating pore‐blocking residues. Moreover, we demonstrated that PC2 will preferentially assemble with PC1 to form heteromeric complexes when PC1 is co‐expressed ...
Tobias Staudner+7 more
wiley +1 more source
The enzyme 5‐lipoxygenase (5‐LOX) catalyzes the first step in the biosynthesis of leukotrienes (LTs) involved in inflammatory pathophysiology. After cellular stimulation, 5‐LOX translocates to the nucleus, interacting with the 5‐LOX‐activating protein (FLAP) to form LTA4 from arachidonic acid (AA).
Erik Romp+5 more
wiley +1 more source
A Computational Interpretation of Context-Free Expressions
We phrase parsing with context-free expressions as a type inhabitation problem where values are parse trees and types are context-free expressions. We first show how containment among context-free and regular expressions can be reduced to a reachability ...
A Frisch+8 more
core +1 more source