Finding maximum independent sets in sparse and general graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Counting Satisfying Assignments in 2-SAT and 3-SAT
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Parameterized Complexity
Finding occurrences of protein complexes in protein-protein interaction graphs
Journal of Discrete Algorithms
Hi-index | 0.00 |
Comparing genomic properties of multiple species at varying evolutionary distances is a powerful approach for studying biological and evolutionary principles. In the context of comparative analysis of protein-protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex. We show that the problem is polynomial-time solvable provided that each protein has at most two orthologs in the other species, but is hard for three. Also, we suggest ways to cope with hardness by proposing three translations of the problem into well-known combinatorial optimization problems, thereby allowing the use of many recent results in fast exponential-time algorithms. Motivated by the need for more accurate models, we conclude by giving and discussing three natural extensions of the problem.