Near optimal solutions for maximum quasi-bicliques

DOI10.1007/s10878-011-9392-4zbMath1293.90075OpenAlexW2078103658MaRDI QIDQ2377385

Lusheng Wang

Publication date: 28 June 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9392-4

zbMATH Keywords

approximation algorithmprotein-protein interaction networksinteracting protein group pairsprotein interaction sitesquasi-bicliques

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Finding dense subgraphs with maximum weighted triangle density ⋮ Mixed Integer Programming for Searching Maximum Quasi-Bicliques ⋮ Highly Bi-Connected Subgraphs for Computational Protein Function Annotation

Uses Software

• iPfam

Cites Work

• Unnamed Item
• Finding biclusters by random projections
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• On the closest string and substring problems

This page was built for publication: Near optimal solutions for maximum quasi-bicliques