Results 121 to 130 of about 7,225,806 (376)
A lexical database tool for quantitative phonological research
, 1997 A lexical database tool tailored for phonological research is described. Database fields include transcriptions, glosses and hyperlinks to speech files.
Bird, Steven
core +3 more sources
Derivatives for Enhanced Regular Expressions [PDF]
, 2016 Regular languages are closed under a wealth of formal language operators. Incorporating such operators in regular expressions leads to concise language specifications, but the transformation of such enhanced regular expressions to finite automata becomes more involved.
openaire +4 more sources
Molecular Oncology, EarlyView.Chronic TGF‐β exposure drives epithelial HCC cells from a senescent state to a TGF‐β resistant mesenchymal phenotype. This transition is characterized by the loss of Smad3‐mediated signaling, escape from senescence, enhanced invasiveness and metastatic potential, and upregulation of key resistance modulators such as MARK1 and GRM8, ultimately promoting
Minenur Kalyoncu +11 more
wiley +1 more source
Novel NFA engine construction method of regular expressions
Tongxin xuebao, 2014 A novel method for constructing smaller non-deterministic finite automata (NFA) engine from given regular expressions named PFA was proposed.There are three main algorithms in PFA,the pretreatment algorithm,the coding parser tree algorithm and the NFA ...
Mao-hua JING +3 more
doaj
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
Molecular Oncology, EarlyView.We identified adaptor protein ShcD as upregulated in triple‐negative breast cancer and found its expression to be correlated with reduced patient survival and increased invasion in cell models. Using a proteomic screen, we identified novel ShcD binding partners involved in EGFR signaling pathways.
Hayley R. Lau +11 more
wiley +1 more source
Improved space protocol identification algorithm
Tongxin xuebao, 2012 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
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
Automated DNA Motif Discovery [PDF]
, 2010 Ensembl's human non-coding and protein coding genes are used to automatically find DNA pattern motifs. The Backus-Naur form (BNF) grammar for regular expressions (RE) is used by genetic programming to ensure the generated strings are legal.
Graillet, Olivia Sanchez +2 more
core +2 more sources
Molecular Oncology, EarlyView.Dual targeting of AKT and mTOR using MK2206 and RAD001 reduces tumor burden in an intracardiac colon cancer circulating tumor cell xenotransplantation model. Analysis of AKT isoform‐specific knockdowns in CTC‐MCC‐41 reveals differentially regulated proteins and phospho‐proteins by liquid chromatography coupled mass spectrometry. Circulating tumor cells
Daniel J. Smit +19 more
wiley +1 more source