Searching and inferring colorful topological motifs in vertex-colored graphs
type: Item
instance of: scholarly article
title: Searching and inferring colorful topological motifs in vertex-colored graphs
zbMATH Open document ID: 1447.92172
author: Diego P. Rubert
author: Eloi Araujo
author: Marco A. Stefanes
author: Jens Stoye
author: Fábio Viduani Martinez
published in: Journal of Combinatorial Optimization
publication date: 2020-07-29T00:00:00Z
Mathematics Subject Classification ID: 92C42
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 92-08
zbMATH DE Number: 7225487
zbMATH Keywords: computational biology
zbMATH Keywords: biological networks
zbMATH Keywords: colorful topological motifs
zbMATH Keywords: frequent motifs in graphs
describes a project that uses: GO-TermFinder
describes a project that uses: MetaCyc
describes a project that uses: FANMOD
describes a project that uses: Kavosh
describes a project that uses: GraMoFoNe
describes a project that uses: SIMBio
describes a project that uses: QPath
describes a project that uses: QNet
MaRDI profile type: Publication
full work available at URL: s10878-020-00590-4
OpenAlex ID: W3033751496
cites work: Q3651735
cites work: Complexity issues in vertex-colored graph pattern matching
cites work: Some remarks on the theory of graphs
cites work: Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
cites work: Upper and lower bounds for finding connected motifs in vertex-colored graphs
cites work: Q4198056
cites work: Finding and counting vertex-colored subtrees
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: Q3002818
cites work: Deterministic parameterized algorithms for the graph motif problem
cites work: Algorithms for topology-free and alignment network queries
DOI: 10.1007/S10878-020-00590-4
description: scientific article; zbMATH DE number 7225487