Results 111 to 120 of about 551,541 (325)
Minimal bi-ideals in regular and completely regular ordered semigroups [PDF]
Here we characterize regular and completely regular ordered semigroups by their minimal bi-ideals. A minimal bi-ideal is expressed as a product of a minimal right ideal and a minimal left ideal. Furthermore, we show that every bi-ideal in a completely regular ordered semigroup is minimal and hence a regular ordered semigroup S is completely regular if ...
arxiv
Cancer stem cells are associated with aggressive disease, but a deep characterization of such markers is lacking in endometrial cancer. This study uses imaging mass cytometry to explore putative cancer stem cell markers in endometrial tumors and corresponding organoid models.
Hilde E. Lien+7 more
wiley +1 more source
Improved space protocol identification algorithm
An improved boyer-moore (BM) algorithm for space protocol identification was proposed.First,a space data preprocessing technique based on bit distance was used to increase the size of data set.A decimal jumping technique was introduced to enhance the ...
Tian-ming ZHENG+4 more
doaj
Regular expressions into finite automata
AbstractIt is a well-established fact that each regular expression can be transformed into a nondeterministic finite automaton (NFA) with or without ε-transitions, and all authors seem to provide their own variant of the construction. Of these, Berry and Sethi (1986) have shown that the construction of an ε-free NFA due to Glushkov (1961) is a natural ...
openaire +2 more sources
Peripheral blood proteome biomarkers distinguish immunosuppressive features of cancer progression
Immune status significantly influences cancer progression. This study used plasma proteomics to analyze benign 67NR and malignant 4T1 breast tumor models at early and late tumor stages. Immune‐related proteins–osteopontin (Spp1), lactotransferrin (Ltf), calreticulin (Calr) and peroxiredoxin 2 (Prdx2)–were associated with systemic myeloid‐derived ...
Yeon Ji Park+6 more
wiley +1 more source
This article defines the formal definition of the computer program language Numeric Regular Expression. A language concept inspired by Regular Expression syntax, applying your power and flexibility to numeric chains are describe.
Bruno Vier Hoffmeister, Marta Bez
doaj +1 more source
Forkable Regular Expressions [PDF]
We consider forkable regular expressions, which enrich regular expressions with a fork operator, to establish a formal basis for static and dynamic analysis of the communication behavior of concurrent programs. We define a novel compositional semantics for forkable expressions, establish their fundamental properties, and define derivatives for them as ...
arxiv
This slide deck was presented at the Library Carpentry Workshop at SUB Hamburg on Nov 5 2018. Please note: This presentation is incomplete without the oral speech.
openaire +2 more sources
Stochastic variation in the FOXM1 transcription program mediates replication stress tolerance
Cellular heterogeneity is a major cause of drug resistance in cancer. Segeren et al. used single‐cell transcriptomics to investigate gene expression events that correlate with sensitivity to the DNA‐damaging drugs gemcitabine and prexasertib. They show that dampened expression of transcription factor FOXM1 and its target genes protected cells against ...
Hendrika A. Segeren+4 more
wiley +1 more source
Finite State Automata from Regular Expression Trees [PDF]
Robert R. Goldberg
openalex +1 more source