Novel Approaches for Analyzing Biological Networks

Balabhaskar Balasundaram (), Sergiy Butenko () and Svyatoslav Trukhanov ()
Additional contact information
Balabhaskar Balasundaram: Texas A&M University
Sergiy Butenko: Texas A&M University
Svyatoslav Trukhanov: Texas A&M University

Journal of Combinatorial Optimization, 2005, vol. 10, issue 1, No 3, 23-39

Abstract: 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.

Keywords: n-cliques; n-clubs; clique relaxations; social networks; biological networks (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (25)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-005-1857-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:10:y:2005:i:1:d:10.1007_s10878-005-1857-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-005-1857-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().