Results 51 to 60 of about 554,031 (298)

The naming game on the complete graph

Electronic Journal of Probability, 2018
We consider a model of language development, known as the naming game, in which agents invent, share and then select descriptive words for a single object, in such a way as to promote local consensus. When formulated on a finite and connected graph, a global consensus eventually emerges in which all agents use a common unique word.
openaire   +4 more sources

The Caenorhabditis elegans DPF‐3 and human DPP4 have tripeptidyl peptidase activity

FEBS Letters, EarlyView.
The dipeptidyl peptidase IV (DPPIV) family comprises serine proteases classically defined by their ability to remove dipeptides from the N‐termini of substrates, a feature that gave the family its name. Here, we report the discovery of a previously unrecognized tripeptidyl peptidase activity in DPPIV family members from two different species.
Aditya Trivedi, Rajani Kanth Gudipati
wiley   +1 more source

ENTROPY OF SOME MODELS OF SPARSE RANDOM GRAPHS WITH VERTEX-NAMES [PDF]

Probability in the Engineering and Informational Sciences, 2014
Consider the setting of sparse graphs on N vertices, where the vertices have distinct “names”, which are strings of length O(log N) from a fixed finite alphabet. For many natural probability models, the entropy grows as c N log N for some model-dependent rate constant c.
Aldous, David J, Ross, Nathan
openaire   +5 more sources

Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10

FEBS Letters, EarlyView.
Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang, Satoshi Hashimoto, Sota Ito, Chisato Kikuguchi, Miho Hoshi, Kiyoshi Yamaguchi, Yoichi Furukawa, Toru Suzuki, Toshifumi Inada   +8 more
wiley   +1 more source

Mining Brain Networks using Multiple Side Views for Neurological Disorder Identification

, 2015
Mining discriminative subgraph patterns from graph data has attracted great interest in recent years. It has a wide variety of applications in disease diagnosis, neuroimaging, etc.
Cao, Bokai, Kong, Xiangnan, Ragin, Ann B., Yu, Philip S., Zhang, Jingyuan   +4 more
core   +1 more source

PARP inhibitors elicit distinct transcriptional programs in homologous recombination competent castration‐resistant prostate cancer

Molecular Oncology, EarlyView.
PARP inhibitors are used to treat a small subset of prostate cancer patients. These studies reveal that PARP1 activity and expression are different between European American and African American prostate cancer tissue samples. Additionally, different PARP inhibitors cause unique and overlapping transcriptional changes, notably, p53 pathway upregulation.
Moriah L. Cunningham, Jasibel Vasquez‐Gonzalez, Samantha M. Barnada, Salome Tchotorlishvili, Latese Jones, Ryan Maguire, Genevieve Lewis, Kinza Rizwan, Jenny Deng, Salma Koachar, Drithi Patel, Hailey Shankle, Tessa Mulders, Namra Ajmal, Charalambos Solomides, Emad S. Alnemri, Teresa F. Alnemri, Ayesha A. Shafi, Leonard G. Gomella, Wm Kevin Kelly, Steven B. McMahon, Matthew J. Schiewer   +21 more
wiley   +1 more source

Modelling Calculi with Name Mobility using Graphs with Equivalences

Electronic Notes in Theoretical Computer Science, 2007
AbstractIn the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to be quite useful for modelling purposes, but, at the same time, problematic for the development of a satisfactory partial order concurrent semantics for rewrites ...
Baldan P., GADDUCCI, FABIO, MONTANARI, UGO GIOVANNI ERASMO   +2 more
openaire   +1 more source

Named Entity Recognition based on a Graph Structure

Computación y Sistemas, 2020
The identification of indirect relationships between texts from different sources makes the task of text mining useful when the goal is to obtain the most valuable information from a set of texts. That is why in the field of information retrieval the correct recognition of named entities plays an important role when extracting valuable information in ...
Muñoz, David, Téllez, Fernando Pérez, Pinto, David   +2 more
openaire   +5 more sources

Modeling hepatic fibrosis in TP53 knockout iPSC‐derived human liver organoids

Molecular Oncology, EarlyView.
This study developed iPSC‐derived human liver organoids with TP53 gene knockout to model human liver fibrosis. These organoids showed elevated myofibroblast activation, early disease markers, and advanced fibrotic hallmarks. The use of profibrotic differentiation medium further amplified the fibrotic signature seen in the organoids.
Mustafa Karabicici, Soheil Akbari, Ceyda Caliskan, Canan Celiker, Ozden Oz, Leman Binokay, Gökhan Karakulah, Serif Senturk, Esra Erdal   +8 more
wiley   +1 more source

IPC: A Benchmark Data Set for Learning with Graph-Structured Data [PDF]

, 2019
Benchmark data sets are an indispensable ingredient of the evaluation of graph-based machine learning methods. We release a new data set, compiled from International Planning Competitions (IPC), for benchmarking graph classification, regression, and ...
Chen, Jie, Ferber, Patrick, Huo, Siyu, Katz, Michael, Ma, Tengfei   +4 more
core   +1 more source