Complexity issues in vertex-colored graph pattern matching
From MaRDI portal
(Redirected from Publication:533412)
Recommendations
Cites work
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Algorithm engineering for color-coding with applications to signaling pathway detection
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Analogs & duals of the MAST problem for sequences & trees
- Color-coding
- Complexity results on a paint shop problem.
- Complexity results on restricted instances of a paint shop problem for words
- Fourier meets M\"{o}bius: fast subset convolution
- Introduction to algorithms.
- Maximum Motif Problem in Vertex-Colored Graphs
- Non deterministic polynomial optimization problems and their approximations
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- On the complexity of comparing evolutionary trees
- Optimization, approximation, and complexity classes
- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
- Parameterized Complexity and Approximability of the SLCS Problem
- Parametrized complexity theory.
- Research in Computational Molecular Biology
- Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
Cited in
(24)- Approximation hardness of the cross-species conserved active modules detection problem
- Algorithmic aspects of the maximum colorful arborescence problem
- Finding approximate and constrained motifs in graphs
- Constrained multilinear detection for faster functional motif discovery
- The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be?
- Maximum disjoint paths on edge-colored graphs: approximability and tractability
- Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
- Exact exponential algorithms to find a tropical connected set of minimum size
- Finding supported paths in heterogeneous networks
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Heuristic algorithms for the maximum colorful subtree problem
- Finding and counting vertex-colored subtrees
- Deterministic parameterized algorithms for the graph motif problem
- Finding approximate and constrained motifs in graphs
- Colourful components in \(k\)-caterpillars and planar graphs
- Probably optimal graph motifs
- Searching and inferring colorful topological motifs in vertex-colored graphs
- Binary jumbled pattern matching on trees and tree-like structures
- Maximum Motif Problem in Vertex-Colored Graphs
- Algorithms for topology-free and alignment network queries
- Fixed-parameter algorithms for scaffold filling
- Some results on more flexible versions of Graph Motif
- The graph motif problem parameterized by the structure of the input graph
- Exact exponential algorithms to find tropical connected sets of minimum size
This page was built for publication: Complexity issues in vertex-colored graph pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533412)
