Results 41 to 50 of about 413,827 (305)

Simplifying regular expressions further

open access: yesJournal of Symbolic Computation, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Kahrs, Colin Runciman
openaire   +1 more source

Regular Expression Patterns

open access: yes, 2004
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as found in Haskell.
Svenningsson, Josef   +5 more
core   +1 more source

Claudin‐6 Protein Expression in Atypical Teratoid/Rhabdoid Tumors Is Strongly Enriched in the Molecular Subgroup AT/RT‐TYR

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Claudin‐6 has emerged as a promising immunotherapeutic target, yet protein‐level data in atypical teratoid/rhabdoid tumors (AT/RTs) have been inconsistent. We analyzed 36 well‐characterized AT/RT samples and found membranous claudin‐6 protein expression in 58% of cases, with striking enrichment in the molecular subgroup AT/RT‐TYR (100%) and ...
Victoria E. Fincke   +4 more
wiley   +1 more source

Efficacy and Safety Analysis of Roxarestat in Regulating Renal Anemia in Patients on Maintenance Hemodialysis

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley   +1 more source

Parameterized regular expressions and their languages

open access: yesTheoretical Computer Science, 2013
We study regular expressions that use variables, or parameters, which are interpreted as alphabet letters. We consider two classes of languages denoted by such expressions: under the possibility semantics, a word belongs to the language if it is denoted by some regular expression obtained by replacing variables with letters; under the certainly ...
Pablo Barceló   +2 more
openaire   +9 more sources

Real-time Regular Expression Matching

open access: yes, 2023
This paper is devoted to finite state automata, regular expression matching, pattern recognition, and the exponential blow-up problem, which is the growing complexity of automata exponentially depending on regular expression length. This paper presents a
Bernadotte, Alexandra
core  

Effects of the Fluid Replacement Method During Online Hemodiafiltration on the Solute Removal Performance and Biocompatibility Using the Asymmetric Cellulose Triacetate Membrane

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Pre‐dilution online hemodiafiltration (Pre‐HDF) is predominantly used in Japan, whereas post‐dilution online HDF (Post‐HDF) is more common in Europe. An asymmetric cellulose triacetate (ATA) membrane may improve biocompatibility.
Kenji Sakurai   +4 more
wiley   +1 more source

Infection Control Practices for Vascular Access Management in Hemodialysis: Results From a Nationwide Survey of Japanese National University Hospitals

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Bloodstream infections due to repeated vascular access (VA) puncture and circuit connections remain major concerns in hemodialysis. Therefore, we examined current practices for glove, disinfectant, and personal protective equipment (PPE) use according to VA type in national university hospitals in Japan.
Aiko Yamada   +6 more
wiley   +1 more source

Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2014
We develop a formal perspective on how regular expression matching works in Java, a popular representative of the category of regex-directed matching engines.
Martin Berglund   +2 more
doaj   +1 more source

Minimizing nfa's and regular expressions

open access: yesJournal of Computer and System Sciences, 2005
We show inapproximability results concerning minimization of nondeterministic finite automata (nfa's) as well as of regular expressions relative to given nfa's, regular expressions or deterministic finite automata (dfa's). We show that it is impossible to efficiently minimize a given nfa or regular expression with n states, transitions, respectively ...
Gregor Gramlich, Georg Schnitger
openaire   +1 more source

Home - About - Disclaimer - Privacy