Novel approaches for analyzing biological networks Conference Paper

abstract

• 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 Springer Science + Business Media, Inc.

authors

• Butenko, Sergiy

published proceedings

• JOURNAL OF COMBINATORIAL OPTIMIZATION

author list (cited authors)

• Balasundaram, B., Butenko, S., & Trukhanov, S.

citation count

• 100

complete list of authors

• Balasundaram, B||Butenko, S||Trukhanov, S

publication date

• January 2005

publisher

• Springer Nature  Publisher

published in

• Journal of Combinatorial Optimization  Journal

keywords

• Biological Networks
• Clique Relaxations
• N-cliques
• N-clubs
• Social Networks

Digital Object Identifier (DOI)

• 10.1007/s10878-005-1857-x

start page

• 23

end page

• 39

volume

• 10

issue

• 1

URL

• http://dx.doi.org/10.1007/s10878-005-1857-x