Near optimal solutions for maximum quasi-bicliques

Lusheng Wang ()
Additional contact information
Lusheng Wang: City University of Hong Kong

Journal of Combinatorial Optimization, 2013, vol. 25, issue 3, No 7, 497 pages

Abstract: Abstract The maximum quasi-biclique problem has been proposed for finding interacting protein group pairs from large protein-protein interaction (PPI) networks. The problem is defined as follows: The Maximum Quasi-biclique Problem: Given a bipartite graph G=(X∪Y,E) and a number 0 0, where X opt and Y opt form the optimal solution.

Keywords: Protein-protein interaction networks; Interacting protein group pairs; Protein interaction sites; Quasi-bicliques; Approximation algorithm (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9392-4 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:25:y:2013:i:3:d:10.1007_s10878-011-9392-4

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

DOI: 10.1007/s10878-011-9392-4

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 ().