Results 161 to 170 of about 6,576,413 (265)

Network motif detection using hidden markov models. [PDF]

Sci Rep
Bampos C, Megalooikonomou V.
europepmc   +1 more source

Efficient classical sampling from Gaussian boson sampling distributions on unweighted graphs. [PDF]

Nat Commun
Zhang Y, Zhou S, Wang X, Wang Z, Yang Z, Yang R, Xue Y, Li T.   +7 more
europepmc   +1 more source

Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width

ECML/PKDD, 2013
T. Horváth, Keisuke Otaki, J. Ramon
semanticscholar   +1 more source

Systematic discovery of disease-modifying targets by prediction from knowledge graph-based AI model and experimental validation: Parkinson's disease case. [PDF]

Comput Struct Biotechnol J
So M, Park SJ, Kim D, Han S, Koo HJ, Kim T, Shin MG, Lee EJ.   +7 more
europepmc   +1 more source

Orthology and near-cographs in the context of phylogenetic networks. [PDF]

Algorithms Mol Biol
Lindeberg A, Scholz GE, Wieseke N, Hellmuth M.   +3 more
europepmc   +1 more source

Induced subgraph isomorphism: Are some patterns substantially easier than others?

Theoretical Computer Science, 2012
Peter Floderus, Miroslaw Kowaluk, A. Lingas, Eva-Marta Lundell   +3 more
semanticscholar   +1 more source

OFGPMA: Optimal frequency graph representation learning for pseudogene and miRNA association prediction. [PDF]

Front Genet
Zeng Y, Xiong L, Luo Y.
europepmc   +1 more source

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number [PDF]

Daniel Lokshtanov, Michał Pilipczuk, Marta Piecyk   +2 more
openalex  

Large induced subgraphs with $k$ vertices of almost maximum degree [PDF]

, 2017
António Girão, Kamil Popielarz
openalex  

Simplex polynomial in complex networks and its applications to compute the Euler characteristic. [PDF]

Front Comput Neurosci
Wang Z, Fu X, Deng B, Chen Y, Zhao H.
europepmc   +1 more source