Results 131 to 140 of about 893,970 (343)
Small NFAs from Regular Expressions: Some Experimental Results
, 2010 Regular expressions (res), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recognition depend on the size of the equivalent nondeterministic finite automata
Gouveia, Hugo +2 more
core +1 more source
Molecular Oncology, EarlyView.Epithelial–mesenchymal transition (EMT) and tumor‐infiltrating lymphocytes (TILs) are associated with early breast cancer response to neoadjuvant chemotherapy (NAC). This study evaluated EMT and TIL shifts, with immunofluorescence and RNA sequencing, at diagnosis and in residual tumors as potential biomarkers associated with treatment response.
Françoise Derouane +16 more
wiley +1 more source
Containment of Nested Regular Expressions [PDF]
arXiv, 2013 Nested regular expressions (NREs) have been proposed as a powerful formalism for querying RDFS graphs, but research in a more general graph database context has been scarce, and static analysis results are currently lacking. In this paper we investigate the problem of containment of NREs, and show that it can be solved in PSPACE, i.e., the same ...
arxiv
Molecular Oncology, EarlyView.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
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions [PDF]
arXiv, 2017 In the present paper, we study the match test for extended regular expressions. We approach this NP-complete problem by introducing a novel variant of two-way multihead automata, which reveals that the complexity of the match test is determined by a hidden combinatorial property of extended regular expressions, and it shows that a restriction of the ...
arxiv
Regular expressions into finite automata
Theoretical Computer Science, 1993 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
Molecular Oncology, EarlyView.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
WebCollectives: A light regular expression based web content extractor in Java
SoftwareX, 2023 Conventional web crawling methods typically involve a sequence of distinct steps for downloading and extracting web content. A noteworthy limitation of these conventional crawling approaches is their lack of a focus-based crawling strategy.
Hayri Volkan Agun
doaj
Minimal bi-ideals in regular and completely regular ordered semigroups [PDF]
arXiv, 2017 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