Parameterized algorithms for module motif

DOI10.1007/978-3-642-40313-2_72MaRDI QIDQ2849965zbMATH OpenOpenAlexFDO

Authors Meirav Zehavi

Publication date 20 September 2013

Published in Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40313-2_72

zbMATH Keywords

module motifparameterized algorithmpattern matching

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 the module motif problem
• 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

Cited in

(9)

• Partial information network queries
• Parameterized algorithms for the module motif problem
• Mixing Color Coding-Related Techniques
• Improved algorithms for several parameterized problems based on random methods
• Engineering motif search for large motifs
• Parameterized algorithms for module map problems
• Parameterized algorithms for module map problems
• The \(k\)-distinct language: parameterized automata constructions
• Parameterized algorithms for list \(K\)-cycle

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

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