Results 91 to 100 of about 101,745 (269)
GRAPES-DD: exploiting decision diagrams for index-driven search in biological graph databases
BMC Bioinformatics, 2021 Background Graphs are mathematical structures widely used for expressing relationships among elements when representing biomedical and biological information. On top of these representations, several analyses are performed. A common task is the search of
Nicola Licheri +3 more
doaj +1 more source
A Sharper Ramsey Theorem for Constrained Drawings
Journal of Graph Theory, Volume 109, Issue 4, Page 401-411, August 2025.ABSTRACT Given a graph G and a collection C of subsets of R d indexed by the subsets of vertices of G, a constrained drawing of G is a drawing where each edge is drawn inside some set from C, in such a way that nonadjacent edges are drawn in sets with disjoint indices. In this paper we prove a Ramsey‐type result for such drawings.
Pavel Paták
wiley +1 more source
R Package FrF2 for Creating and Analyzing Fractional Factorial 2-Level Designs
Journal of Statistical Software, 2014 This article describes the R package FrF2 for design and analysis of experiments with 2-level factors. The package offers both regular and non-regular fractional factorial 2-level designs, in the regular case with blocking and split plot facilities and ...
Ulrike Grömping
doaj +1 more source
Application of dynamic expansion tree for finding large network motifs in biological networks [PDF]
PeerJ, 2019 Network motifs play an important role in the structural analysis of biological networks. Identification of such network motifs leads to many important applications such as understanding the modularity and the large-scale structure of biological networks,
Sabyasachi Patra, Anjali Mohapatra
doaj +2 more sources
Computing and Drawing Isomorphic Subgraphs [PDF]
, 2002 The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. Then the graph partitions into a large subgraph, its copy and a remainder. The problem resembles the NP-hard largest common subgraph problem.
Franz-Josef Brandenburg, Sabine Bachl
openaire +2 more sources
The Generic Circular Triangle‐Free Graph
Journal of Graph Theory, Volume 109, Issue 4, Page 426-445, August 2025.ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G embeds into C 3 if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 }‐free graph.
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley +1 more source
MODIT: MOtif DIscovery in Temporal Networks
Frontiers in Big Data, 2022 Temporal networks are graphs where each edge is linked with a timestamp, denoting when an interaction between two nodes happens. According to the most recently proposed definitions of the problem, motif search in temporal networks consists in finding and
Roberto Grasso +4 more
doaj +1 more source
Note on Hamiltonicity of Basis Graphs of Even Delta‐Matroids
Journal of Graph Theory, Volume 109, Issue 4, Page 446-453, August 2025.ABSTRACT We show that the basis graph of an even delta‐matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges e and f sharing a common end, it has a Hamiltonian cycle using e and avoiding f unless it has at most two vertices or it is a cycle of length at most four.
Donggyu Kim, Sang‐il Oum
wiley +1 more source
Hierarchical Harmonization of Atom-Resolved Metabolic Reactions across Metabolic Databases
Metabolites, 2021 Metabolic models have been proven to be useful tools in system biology and have been successfully applied to various research fields in a wide range of organisms.
Huan Jin, Hunter N. B. Moseley
doaj +1 more source