Results 91 to 100 of about 7,225,806 (376)

(Un)Decidability Results for Word Equations with Length and Regular Expression Constraints [PDF]

open access: yes, 2013
We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints.
Ganesh, Vijay   +3 more
core  

MET variants with activating N‐lobe mutations identified in hereditary papillary renal cell carcinomas still require ligand stimulation

open access: yesMolecular Oncology, EarlyView.
MET variants in the N‐lobe of the kinase domain, found in hereditary papillary renal cell carcinoma, require ligand stimulation to promote cell transformation, in contrast to other RTK variants. This suggests that HGF expression in the microenvironment is important for tumor growth in such patients. Their sensitivity to MET inhibitors opens the way for
Célia Guérin   +14 more
wiley   +1 more source

Deafness mutation mining using regular expression based pattern matching

open access: yesBMC 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

Response to neoadjuvant chemotherapy in early breast cancers is associated with epithelial–mesenchymal transition and tumor‐infiltrating lymphocytes

open access: yesMolecular 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

Tumor necrosis factor gene expression in regular hemodialysis patients

open access: yesSaudi Journal of Kidney Diseases and Transplantation, 2015
This study evaluates tumor necrosis factor (TNF)-alfa gene expression in patients with end-stage renal disease (ESRD) on regular hemodialysis as an expression of cardiovascular disease (CVD) risk even on a sub-clinical level and its relation to some of ...
Hemmat E El Haddad   +5 more
doaj   +1 more source

Understanding Regular Expressions

open access: yesProgramming Historian, 2013
In this lesson, we will use advanced find-and-replace capabilities in a word processing application in order to make use of structure in a brief historical document that is essentially a table in the form of prose.
openaire   +3 more sources

Peripheral blood proteome biomarkers distinguish immunosuppressive features of cancer progression

open access: yesMolecular 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

Fast Regular Expression Matching Using FPGA [PDF]

open access: yes, 2008
V práci je vysvětluje několik algoritmů pro vyhledávání výrazů v textu. Algoritmy pracují v software i hardware. Část práce   se zabývá rozšířením konečných automatů.
Kaštil, Jan
core  

Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

open access: yes, 2007
We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes.
A. Amir   +15 more
core   +4 more sources

Complexity measures for regular expressions

open access: yesProceedings of the sixth annual ACM symposium on Theory of computing - STOC '74, 1974
Several measures of the complexity of a regular expression are defined. (Star height and number of alphabetical symbols are two of them.) Upper and lower estimates for the complexities of expressions for certain sets of paths on graphs are derived.
Andrzej Ehrenfeucht, Paul Zeiger
openaire   +3 more sources

Home - About - Disclaimer - Privacy