Searching and inferring colorful topological motifs in vertex-colored graphs

DOI10.1007/s10878-020-00590-4zbMath1447.92172OpenAlexW3033751496MaRDI QIDQ782751

Diego P. Rubert, Marco A. Stefanes, Jens Stoye, Eloi Araujo, Fábio Viduani Martinez

Publication date: 29 July 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00590-4

zbMATH Keywords

computational biologybiological networkscolorful topological motifsfrequent motifs in graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational methods for problems pertaining to biology (92-08) Systems biology, networks (92C42)

Uses Software

• MetaCyc
• GO-TermFinder
• QNet
• FANMOD
• Kavosh
• GraMoFoNe
• SIMBio
• QPath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic parameterized algorithms for the graph motif problem
• Complexity issues in vertex-colored graph pattern matching
• Upper and lower bounds for finding connected motifs in vertex-colored graphs
• Finding and counting vertex-colored subtrees
• Algorithms for topology-free and alignment network queries
• The Complexity of Some Problems on Subsequences and Supersequences
• Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
• Some remarks on the theory of graphs

This page was built for publication: Searching and inferring colorful topological motifs in vertex-colored graphs