Parameterized algorithms for the module motif problem

DOI10.1016/J.IC.2016.08.005MaRDI QIDQ342716zbMATH OpenOpenAlexFDO

Authors Meirav Zehavi

Publication date 18 November 2016

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2016.08.005

zbMATH Keywords

computational biologypattern matchingkernelizationparameterized algorithmmodule motif

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Systems biology, networks (92C42)

Recommendations

• Parameterized algorithms for module motif
• Deterministic parameterized algorithms for the graph motif problem
• Deterministic parameterized algorithms for the graph motif problem
• The graph motif problem parameterized by the structure of the input graph
• The graph motif problem parameterized by the structure of the input graph

Cites work

• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• A probabilistic remark on algebraic program testing
• Algorithm engineering for color-coding with applications to signaling pathway detection
• Algorithms for topology-free and alignment network queries
• An in-place truncated Fourier transform and applications to polynomial multiplication
• Constrained multilinear detection for faster functional motif discovery
• Deterministic parameterized algorithms for the graph motif problem
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Finding and counting vertex-colored subtrees
• Finding approximate and constrained motifs in graphs
• Fundamentals of parameterized complexity
• Narrow sieves for parameterized paths and packings
• On problems without polynomial kernels
• On the Kernelization Complexity of Colorful Motifs
• Parameterized algorithms for module motif
• Partial information network queries
• Partitive hypergraphs
• Probably optimal graph motifs
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Some results on more flexible versions of Graph Motif
• Upper and lower bounds for finding connected motifs in vertex-colored graphs

Cited in

(8)

• Improved parameterized algorithms for network query problems
• Deterministic parameterized algorithms for the graph motif problem
• Parameterized algorithms for module map problems
• Deterministic parameterized algorithms for the graph motif problem
• Engineering motif search for large motifs
• Parameterized algorithms for module map problems
• Improved parameterized algorithms for network query problems
• Parameterized algorithms for module motif

Describes a project that uses

Uses Software

• QPath
• GraMoFoNe

This page was built for publication: Parameterized algorithms for the module motif problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342716)