Results 141 to 150 of about 889,414 (343)
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
Automated Text Structuring: Natural Language Processing and Regular Expressions in XML Tag Filling
IEEE AccessThe conversion of documents into XML markup requires efficient algorithms and automated solutions. The focus is on tagging documents to meet NISO STS standards, ensuring compatibility across systems.
Ivan P. Malashin +4 more
doaj +1 more source
Deafness mutation mining using regular expression based pattern matching
BMC Medical Informatics and Decision Making, 2007 Background While keyword based queries of databases such as Pubmed are frequently of great utility, the ability to use regular expressions in place of a keyword can often improve the results output by such databases. Regular expressions can allow for the
Frenz Christopher M
doaj +1 more source
Forkable Regular Expressions [PDF]
arXiv, 2015 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
, 2018 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
Molecular Oncology, EarlyView.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]
, 1993 Robert R. Goldberg
openalex +1 more source
Classification of acute myeloid leukemia based on multi‐omics and prognosis prediction value
Molecular Oncology, EarlyView.The Unsupervised AML Multi‐Omics Classification System (UAMOCS) integrates genomic, methylation, and transcriptomic data to categorize AML patients into three subtypes (UAMOCS1‐3). This classification reveals clinical relevance, highlighting immune and chromosomal characteristics, prognosis, and therapeutic vulnerabilities.
Yang Song +13 more
wiley +1 more source
Technology Corner: A Regular Expression Training App
Journal of Digital Forensics, Security and Law, 2012 Regular expressions enable digital forensic analysts to find information in files. The best way for an analyst to become proficient in writing regular expressions is to practice.
Nick Flor
doaj