Parameterized Algorithms for Module Motif

DOI10.1007/978-3-642-40313-2_72zbMath1353.68140OpenAlexW166556521MaRDI QIDQ2849965

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

pattern matchingparameterized 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)

Related Items (7)

Mixing Color Coding-Related Techniques ⋮ Parameterized algorithms for the module motif problem ⋮ Improved Algorithms for Several Parameterized Problems Based on Random Methods ⋮ Parameterized algorithms for list \(K\)-cycle ⋮ Partial information network queries ⋮ The \(k\)-distinct language: parameterized automata constructions ⋮ Unnamed Item

This page was built for publication: Parameterized Algorithms for Module Motif