Finding approximate and constrained motifs in graphs
DOI10.1016/J.TCS.2012.08.023zbMATH Open1297.05081OpenAlexW2152084501MaRDI QIDQ390871FDOQ390871
Authors: Riccardo Dondi, Guillaume Fertin, Stéphane Vialette 
Publication date: 9 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.023
Recommendations
algorithmscomputational complexitycomputational biologygraph motifparameterized complexitybiological networks
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Systems biology, networks (92C42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Collective dynamics of `small-world' networks
- Some APX-completeness results for cubic graphs
- Finding and counting vertex-colored subtrees
- Finding approximate and constrained motifs in graphs
- Color-coding
- Title not available (Why is that?)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Title not available (Why is that?)
- The Turing way to parameterized complexity
- On the Kernelization Complexity of Colorful Motifs
- Complexity issues in vertex-colored graph pattern matching
- Some results on more flexible versions of Graph Motif
- Non deterministic polynomial optimization problems and their approximations
- Research in Computational Molecular Biology
Cited In (14)
- Finding approximate and constrained motifs in graphs
- Some results on more flexible versions of Graph Motif
- Parallel Discovery of Top-k Weighted Motifs in Large Graphs
- Deterministic parameterized algorithms for the graph motif problem
- Complexity issues in vertex-colored graph pattern matching
- Searching and inferring colorful topological motifs in vertex-colored graphs
- Maximum Motif Problem in Vertex-Colored Graphs
- A uniform random graph model for directed acyclic networks and its effect on motif-finding
- Parameterized complexity and approximation issues for the colorful components problems
- Engineering Motif Search for Large Graphs
- Algorithms for topology-free and alignment network queries
- Fixed-parameter algorithms for scaffold filling
- Some results on more flexible versions of Graph Motif
- Exact exponential algorithms to find tropical connected sets of minimum size
This page was built for publication: Finding approximate and constrained motifs in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390871)
