Results 111 to 120 of about 47,591 (350)
Molecular Functions and Drug Prediction of MMP1 and TGFBR2 in Nasopharyngeal Carcinoma
Journal of Clinical Laboratory Analysis, EarlyView.MMP1 and TGFBR2 were validated by machine learning and external datasets as the candidate genes. Dexamethasone showed strong binding affinity to MMP1 (−7.72 kcal/mol) and TGFBR2 (−7.27 kcal/mol) in docking studies. Knockdown of MMP1 repressed the malignant phenotypes of NPC cells.
Feng Wang +5 more
wiley +1 more source
Cliques of Graph Convolutional Networks for Recommendation
IEEE AccessGraph neural networks have become a popular technique for collaborative filtering. However, most related work is based on user-item bipartite graphs, which can generate a large amount of noise due to the broad and elusive interests of users.
Zhenye Pan, Yahong Chen
doaj +1 more source
Detecting highly overlapping community structure by greedy clique expansion
, 2010 Paper presented at the 4th SNA-KDD Workshop ’10 (SNA-KDD’10), held in conjunction with The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2010), July 25, 2010, Washington, DC USAIn complex networks it is common for
Neil Hurley +7 more
core
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
New Reality – New Problems. Financial Crime in Greater Poland in the Years 1945-1970
Studia Historiae Oeconomicae, 2017 Systemic transformation in Poland after the Second World War led to deep transformations within the economy. It did not, however, change the way people thought.
Stanisław Jankowiak
doaj +1 more source
European Journal of Combinatorics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source
, 2010 A complete set of a graph G is a subset of VG whose elements are pairwise adjacent. A clique is a maximal complete set. The clique graph of G, denoted by K(G), is the intersection graph of the family of cliques of G.
Alcón, Liliana Graciela +3 more
core +2 more sources
Graph Theoretic and Pearson Correlation-Based Discovery of Network Biomarkers for Cancer
Data, 2019 Two graph theoretic concepts—clique and bipartite graphs—are explored to identify the network biomarkers for cancer at the gene network level.
Raihanul Bari Tanvir +4 more
doaj +1 more source
Mendeteksi Clique dalam Suatu Graf
, 2013 Given a simple graph G with n vertices. Furthermore, describes an algorithm to get maximum clique in graph G. Every graph G with n vertices and minimum vertex degree δ must have a maximum clique of size at least dn/(n − δ)e.
Apriani, Wiwin
core