Novel approaches for analyzing biological networks

作者:Balasundaram B*; Butenko S; Trukhanov S
来源:Journal of Combinatorial Optimization, 2005, 10(1): 23-39.
DOI:10.1007/s10878-005-1857-x

摘要

This paper proposes clique relaxations to identify clusters in biological networks. In particular, the maximum n-clique and maximum n-club problems on an arbitrary graph are introduced and their recognition versions are shown to be NP-complete. In addition, integer programming formulations are proposed and the results of sample numerical experiments performed on biological networks are reported.

  • 出版日期2005-8