Minimum Recombinant Haplotype Configuration on Tree Pedigrees

  • Koichiro Doi
  • Jing Li
  • Tao Jiang
Conference paper

DOI: 10.1007/978-3-540-39763-2_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2812)
Cite this paper as:
Doi K., Li J., Jiang T. (2003) Minimum Recombinant Haplotype Configuration on Tree Pedigrees. In: Benson G., Page R.D.M. (eds) Algorithms in Bioinformatics. WABI 2003. Lecture Notes in Computer Science, vol 2812. Springer, Berlin, Heidelberg

Abstract

We study the problem of reconstructing haplotype configurations from genotypes on pedigree data under the Mendelian law of inheritance and the minimum recombination principle, which is very important for the construction of haplotype maps and genetic linkage/association analysis. Li and Jiang [9,10] recently proved that the Minimum Recombinant Haplotype Configuration (MRHC) problem is NP-hard, even if the number of marker loci is 2. However, the proof uses pedigrees that contain complex mating loop structures that are not common in practice. The complexity of MRHC in the loopless case was left as an open problem. In this paper, we show that loopless MRHC is NP-hard. We also present two dynamic programming algorithms that can be useful for solving loopless MRHC (and general MRHC) in practice. The first algorithm performs dynamic programming on the members of the input pedigree and is efficient when the number of marker loci is bounded by a small constant. It takes advantage of the tree structure in a loopless pedigree. The second algorithm performs dynamic programming on the marker loci and is efficient when the number of the members of the input pedigree is small. This algorithm also works for the general MRHC problem. We have implemented both algorithms and applied the first one to both simulated and real data. Our preliminary experiments demonstrate that the algorithm is often able to solve MRHC efficiently in practice.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Koichiro Doi
    • 1
  • Jing Li
    • 2
  • Tao Jiang
    • 2
  1. 1.Department of Computer Science, Graduate School of Information Science and TechnologyUniversity of TokyoTokyoJapan
  2. 2.Department of Computer Science and EngineeringUniversity of CaliforniaRiversideUSA

Personalised recommendations