Results 61 to 70 of about 2,196,757 (262)

Graph Pattern Matching: From Intractable to Polynomial Time [PDF]

, 2010
Graph pattern matching is typically defined in terms of sub-graph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often too restrictive to characterize patterns in emerging applications. We propose
Li, Jianzhong, Tang, Nan, Ma, Shuai, Fan, Wenfei; id_orcid, Wu, Yunpeng, Wu, Yinghui   +5 more
core  

Graph-based implicit knowledge discovery from architecture change logs [PDF]

, 2012
Service architectures continuously evolve as a consequence of frequent business and technical change cycles. Architecture change log data represents a source of evolution-centric information in terms of intent, scope and operationalisation to ...
Pooyan Jamshidi (5276344), Aakash, Ahmad, Aakash Ahmad, Ahmad, Aakash, Claus Pahl (12588787), Pahl, Claus, Muteer Arshad, Jamshidi, Pooyan, Pooyan Jamshidi, Arshad, Muteer, Claus Pahl, Muteer Arshad (12620287), Aakash Ahmad (5022314)   +12 more
core   +2 more sources

Single‐cell DNA methylation profiling: Technologies, computation, and applications in precision oncology

Molecular Oncology, EarlyView.
Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley   +1 more source

Graph Algorithms

This is a Reprint of one of the first Special Issues of Algorithms ever published. It focuses on the theoretical and practical performance of algorithms for solving computational problems involving graphs.

core   +1 more source

Genus Distribution for a Graph [PDF]

, 2009
In this paper we develop the technique of a distribution decomposition for a graph. A formula is given to determine genus distribution of a cubic graph.
Liangxia, Wan, Yanpei, Liu, Hong-Jian, Lai   +2 more
core   +1 more source

Random graph models for wireless communication networks [PDF]

, 2010
PhDThis thesis concerns mathematical models of wireless communication networks, in particular ad-hoc networks and 802:11 WLANs. In ad-hoc mode each of these devices may function as a sender, a relay or a receiver.
Song, Linlin
core   +4 more sources

Paclitaxel induces NM2‐dependent cellular contraction through GEF‐H1 dissociation from microtubules and RhoA/ROCK activation in cancer cells

Molecular Oncology, EarlyView.
Taxanes are widely used chemotherapeutics whose effects on cellular mechanics remain poorly understood. We show that paclitaxel induces rapid cellular contraction by promoting GEF‐H1 dissociation from microtubules and non‐muscle myosin II activation through RhoA/ROCK.
Gloria Asensio‐Juárez, Rafael Pérez‐Díaz, Hugo Ramos‐Solano, Marina Garrido‐Casado, Vanessa C. Talayero, Miguel Vicente‐Manzanares   +5 more
wiley   +1 more source

p190A/ARHGAP35 and p190B/ARHGAP5 proteins in endometrial cancer: a novel cancer‐relevant paralog interplay

Molecular Oncology, EarlyView.
This study identifies ARHGAP5, in addition to the frequently mutated ARHGAP35, as significantly mutated in endometrial cancer. Mutations in both genes co‐occur and are associated with their correlated downregulation. Functional CRISPR studies show that both paralogs regulate similar pathways, including actin cytoskeleton organization.
Mathilde Pinault, Capucine Heraud, Mélissa Correia de Oliveira, Véronique Neaud, Valérie Valesco, Valérie Prouzet‐Mauleon, Béatrice Turcq, Jean‐William Dupuy, Anne‐Aurélie Raymond, Sabrina Croce, Frédéric Saltel, Valérie Lagrée, Violaine Moreau   +12 more
wiley   +1 more source

Editing simple graphs

, 2014
We study the complexity of turning a given graph, by edge editing, into a target graph whose critical-clique graph is any fixed graph. The problem came up in practice, in an effort of mining huge word similarity graphs for well structured word clusters.
Damaschke, Peter,, Damaschke, Peter, Mogren, Olof,, Mogren, Olof   +3 more
core   +1 more source

Automating Lexical Graph Construction with Large Language Models: A Scalable Approach to Japanese Multi-Relation Lexical Networks

Knowledge
In recent advancements within natural language processing (NLP), lexical networks play a crucial role in representing semantic relationships between words, enhancing applications from word sense disambiguation to educational tools.
Benedikt Perak, Dragana Špica
doaj   +1 more source