Results 31 to 40 of about 468,741 (299)
Three topological features of regulatory networks control life-essential and specialized subsystems
Scientific Reports, 2021 Gene regulatory networks (GRNs) play key roles in development, phenotype plasticity, and evolution. Although graph theory has been used to explore GRNs, associations amongst topological features, transcription factors (TFs), and systems essentiality are ...
Ivan Rodrigo Wolf +2 more
doaj +1 more source
Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2019 We develop a theory of graph algebras over general fields. This is modelled after the theory developed by Freedman et al. (2007, J. Amer. Math. Soc.20 37–51) for connection matrices, in the study of graph homomorphism functions over real edge weight ...
Jin-Yi Cai, A. Govorov
semanticscholar +1 more source
Determination of the Shortest Hamiltonian Paths in an Arbitrary Graph of Distributed Databases
Российский технологический журнал, 2019 A method has been developed for finding the shortest Hamiltonian path in an arbitrary graph based on the rank approach, which provides high efficiency and a significant reduction in the error in solving the problem of organizing the process of managing ...
E. G. Andrianova +2 more
doaj +1 more source
Journal of Marine Science and Engineering, 2023 We aimed to improve the performance of ship detection methods in synthetic aperture radar (SAR) images by utilizing machine learning (ML) and artificial intelligence (AI) techniques.
Muhammad Yasir +5 more
doaj +1 more source
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
, 2015 Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing the rank of a divisor on a graph is NP-hard.
Kiss, Viktor, Tóthmérész, Lilla
core +1 more source
Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions [PDF]
, 2017 Fractional minimum positive semidefinite rank is defined from r-fold faithful orthogonal representations and it is shown that the projective rank of any graph equals the fractional minimum positive semidefinite rank of its complement.
Hogben, L +3 more
core +1 more source
Graph Spectral Properties of Deterministic Finite Automata
, 2014 We prove that a minimal automaton has a minimal adjacency matrix rank and a minimal adjacency matrix nullity using equitable partition (from graph spectra theory) and Nerode partition (from automata theory). This result naturally introduces the notion of
A. Goldberg +5 more
core +1 more source
Covering of Subspaces by Subspaces [PDF]
, 2012 Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed.
Etzion, Tuvi
core +1 more source
RAG: RNA-As-Graphs web resource
BMC Bioinformatics, 2004 Background The proliferation of structural and functional studies of RNA has revealed an increasing range of RNA's structural repertoire. Toward the objective of systematic cataloguing of RNA's structural repertoire, we have recently described the basis ...
Laserson Uri +6 more
doaj +1 more source
Journal of Marine Science and Engineering, 2022 In order to detect multi-ship encounter situations and improve the safety of navigation, this paper proposed a model which was able to mine multi-ship encounter situations from Automatic identification system (AIS) data and analyze the encounter spatial ...
Jixiang Zhu +4 more
doaj +1 more source