Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem

DOI10.1007/978-3-662-46078-8_20zbMath1435.92023OpenAlexW28249417MaRDI QIDQ5175111

Hayssam Soueidan, Macha Nikolski, Thomas Hume, Guillaume Blin

Publication date: 20 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46078-8_20

zbMATH Keywords

binary treebijective functionconnected subgraphinjective functioninput graph

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Systems biology, networks (92C42)

This page was built for publication: Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem