Results 81 to 90 of about 146,643 (141)

An Effective Graph Clustering Method to Identify Cancer Driver Modules. [PDF]

open access: yesFront Bioeng Biotechnol, 2020
Zhang W   +4 more
europepmc   +1 more source

m2ST: dual multi-scale graph clustering for spatially resolved transcriptomics. [PDF]

open access: yesBioinformatics
Zhang W   +10 more
europepmc   +1 more source

The Utility of Graph Clustering of 5S Ribosomal DNA Homoeologs in Plant Allopolyploids, Homoploid Hybrids, and Cryptic Introgressants. [PDF]

open access: yesFront Plant Sci, 2020
Garcia S   +5 more
europepmc   +1 more source

Triangulating Clustered Graphs

open access: yes, 2002
A clustered graph C=(G,T) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G=(V,E) . Each vertex mu in T corresponds to a subset of the vertices of the graph called ''cluster''. C -planarity is a natural extension of graph planarity for clustered graphs.
Jünger, Michael   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy