Format

Send to

Choose Destination
IEEE/ACM Trans Comput Biol Bioinform. 2004 Apr-Jun;1(2):78-90.

The number of recombination events in a sample history: conflict graph and lower bounds.

Author information

1
Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA 92093-0114, USA. vbafna@cs.ucsd.edu

Abstract

We consider the following problem: Given a set of binary sequences, determine lower bounds on the minimum number of recombinations required to explain the history of the sample, under the infinite-sites model of mutation. The problem has implications for finding recombination hotspots and for the Ancestral Recombination Graph reconstruction problem. Hudson and Kaplan gave a lower bound based on the four-gamete test. In practice, their bound Rm often greatly underestimates the minimum number of recombinations. The problem was recently revisited by Myers and Griffiths, who introduced two new lower bounds Rh and Rs which are provably better, and also yield good bounds in practice. However, the worst-case complexities of their procedures for computing Rh and Rs are exponential and super-exponential, respectively. In this paper, we show that the number of nontrivial connected components, Rc, in the conflict graph for a given set of sequences, computable in time O(nm2), is also a lower bound on the minimum number of recombination events. We show that in many cases, Rc is a better bound than Rh. The conflict graph was used by Gusfield et al. to obtain a polynomial time algorithm for the galled tree problem, which is a special case of the Ancestral Recombination Graph (ARG) reconstruction problem. Our results also offer some insight into the structural properties of this graph and are of interest for the general Ancestral Recombination Graph reconstruction problem.

PMID:
17048383
DOI:
10.1109/TCBB.2004.23
[Indexed for MEDLINE]

Supplemental Content

Full text links

Icon for IEEE Engineering in Medicine and Biology Society
Loading ...
Support Center