Hostname: page-component-7479d7b7d-t6hkb Total loading time: 0 Render date: 2024-07-09T00:48:30.010Z Has data issue: false hasContentIssue false

The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification

Published online by Cambridge University Press:  28 July 2010

Hans-Joachim Böckenhauer
Affiliation:
Department of Computer Science, ETH Zurich, Switzerland; {hjb, oravecj, bjoern.steffen, monika.steinova}@inf.ethz.ch
Michal Forišek
Affiliation:
Department of Computer Science, Comenius University Bratislava, Slovakia; forisek@dcs.fmph.uniba.sk
Ján Oravec
Affiliation:
Department of Computer Science, ETH Zurich, Switzerland; {hjb, oravecj, bjoern.steffen, monika.steinova}@inf.ethz.ch
Björn Steffen
Affiliation:
Department of Computer Science, ETH Zurich, Switzerland; {hjb, oravecj, bjoern.steffen, monika.steinova}@inf.ethz.ch
Kathleen Steinhöfel
Affiliation:
Department of Computer Science, King's College London, UK; kathleen.steinhofel@kcl.ac.uk
Monika Steinová
Affiliation:
Department of Computer Science, ETH Zurich, Switzerland; {hjb, oravecj, bjoern.steffen, monika.steinova}@inf.ethz.ch
Get access

Abstract

Analyzing genomic data for finding those gene variations which are responsible for hereditary diseases is one of the great challenges in modern bioinformatics. In many living beings (including the human), every gene is present in two copies, inherited from the two parents, the so-called haplotypes. In this paper, we propose a simple combinatorial model for classifying the set of haplotypes in a population according to their responsibility for a certain genetic disease. This model is based on the minimum-ones 2SAT problem with uniform clauses. The minimum-ones 2SAT problem asks for a satisfying assignment to a satisfiable formula in 2CNF which sets a minimum number of variables to true. This problem is well-known to be $\mathcal{NP}$-hard, even in the case where all clauses are uniform, i.e., do not contain a positive and a negative literal. We analyze the approximability and present the first non-trivial exact algorithm for the uniform minimum-ones 2SAT problem with a running time of $\mathcal{O}$(1.21061n) on a 2SAT formula with n variables. We also show that the problem is fixed-parameter tractable by showing that our algorithm can be adapted to verify in $\mathcal{O}^*$(2k) time whether an assignment with at most k true variables exists.

Type
Research Article
Copyright
© EDP Sciences, 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aspvall, B., Plass, M.F. and Tarjan, R.E., A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Proc. Lett. 8 (1979) 121123. CrossRef
H.-J. Böckenhauer and D. Bongartz, Algorithmic Aspects of Bioinformatics. Natural Computing Series, Springer-Verlag (2007).
Bonizzoni, P., Vedova, G.D., Dondi, R. and The, J. Li haplotyping problem: An overview of computational models and solutions. J. Comput. Sci. Technol. 18 (2003) 675688. CrossRef
Chen, J., Kanj, I. and Jia, W., Vertex cover: further observations and further improvements. J. Algorithms 41 (2001) 280301. CrossRef
Dinur, I. and Safra, S., On the hardness of approximating minimum vertex cover. Ann. Math. 162 (2005) 439485. CrossRef
Gusfield, D. and Pitt, L., A bounded approximation for the minimum cost 2-sat problem. Algorithmica 8 (1992) 103117. CrossRef
J. Hromkovič, Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. Texts in Theoretical Computer Science, An EATCS Series, Springer-Verlag, Berlin (2003).
G. Karakostas, A better approximation ratio for the vertex cover problem. Technical Report TR04-084, ECCC (2004).
Khot, S. and Regev, O., Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci. 74 (2008) 335349. CrossRef
J. Kiniwa, Approximation of self-stabilizing vertex cover less than 2, in Self Stabilizing Systems (2005) 171–182.
Lawler, E.L. and Wood, D.E., Branch-and-bound methods: A survey. Operat. Res. 14 (1966) 699719. CrossRef
Li, J. and Jiang, T., A survey on haplotyping algorithms for tightly linked markers. J. Bioinf. Comput. Biol. 6 (2008) 241259. CrossRef
J.M. Robson, Finding a maximum independent set in time O(2 n/4). Technical Report 1251-01, LaBRI, Université Bordeaux I (2001).