Results 51 to 60 of about 319,166 (311)
NETASPNO: Approximate Strict Pattern Matching Under Nonoverlapping Condition
In pattern matching, a gap constraint is a more flexible wildcard than traditional wildcards “?”and “*”. Pattern matching with gap constraints is more difficult to handle and fulfills user's enquiries more easily.
Youxi Wu +4 more
doaj +1 more source
ABSTRACT Background Sickle cell disease (SCD) is a chronic, inherited hemoglobinopathy that requires frequent hospitalization for disease‐related complications. Canadian data on inpatient care is limited. This study compared caregiver‐reported hospital experiences of children with SCD to those with cystic fibrosis (CF), a chronic, autosomal recessive ...
Hailey M. Zwicker +11 more
wiley +1 more source
On-Line Pattern Matching on D-Texts (Invited Talk)
The Elastic Degenerate String Matching (EDSM) problem is defined as that of finding an occurrence of a pattern P of length m in an ED-text T. A D-text (Degenerate text) is a string that actually represents a set of similar and aligned strings (e.g. a pan-
Nadia Pisanti, Pisanti, Nadia
core +1 more source
ABSTRACT Background Children with acute lymphoblastic leukemia (ALL) are at risk of severe outcomes from SARS‐CoV‐2 (SCV2). In the post‐pandemic context, where most children have been infected with SCV2, there are limited data on whether vaccination remains beneficial in children with ALL.
Janna R. Shapiro +11 more
wiley +1 more source
ABSTRACT Immune effector cell‐associated hemophagocytic lymphohistiocytosis‐like syndrome (IEC‐HS) is a life‐threatening hyperinflammatory toxicity distinct from cytokine release syndrome (CRS) and neurotoxicity following chimeric antigen receptor T‐cell (CAR‐T) therapy. In a single‐institution retrospective cohort of pediatric and young adult patients
Thomas J. Galletta +6 more
wiley +1 more source
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching [PDF]
We present parallel algorithms for exact and approximate pattern matching with suffix arrays, using a CREW-PRAM with p processors. Given a static text of length n, we first show how to compute the suffix array interval of a given pattern of length m in O(
Kurpicz, Florian +2 more
core +1 more source
Cryptographic Pattern Matching
AbstractWe construct a language extension for process calculi for modelling the exchange of cryptographically composed data. More specifically, we devise a succinct syntax for terms and patterns that captures the intention behind perfect cryptography. The proposed language extension is independent of the choice of process calculus and is applicable to ...
Christoffer Rosenkilde Nielsen +2 more
openaire +1 more source
The Role of Hematopoietic Cell Transplantation in Ataxia‐Telangiectasia
ABSTRACT Background Ataxia‐telangiectasia (A‐T) is a DNA repair disorder characterized by neurodegeneration, immunodeficiency, and cancer predisposition. Hematopoietic cell transplantation (HCT) is an established therapy in related disorders such as Fanconi anemia (FA) and Nijmegen breakage syndrome (NBS), but its role in A‐T is unclear.
Laila Alkhouli +3 more
wiley +1 more source
Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform
Point pattern matching is an important topic of computer vision and pattern recognition. In this paper, we propose a point pattern matching algorithm for two planar point sets under Euclidean transform.
Xiaoyun Wang, Xianquan Zhang
doaj +1 more source
Toward the asymptotic count of bi-modular hidden patterns under probabilistic dynamical sources: a case study [PDF]
Consider a countable alphabet $\mathcal{A}$. A multi-modular hidden pattern is an $r$-tuple $(w_1,\ldots , w_r)$, where each $w_i$ is a word over $\mathcal{A}$ called a module.
Loïck Lhote, Manuel E. Lladser
doaj +1 more source

