Haplotypes histories as pathways of recombinations.
BACKGROUND
The diversity of a haplotype, represented as a string of polymorphic sites along a DNA sequence, increases exponentially with the number of sites if recombinations are taking place. Reconstructing the history of recombinations compared with that of the polymorphic sites is thus extremely difficult. However, in the human genome, because of the relatively simple pattern of haplotype diversity dominated by a few ancestral haplotypes, the complexity of the recombinational network can be reduced, thus making its reconstruction feasible. We focus on the problem of inferring the recombination pathways starting with putative ancestral haplotypes and leading to new rare recombinant haplotypes.


RESULTS
We describe classes of recombinations that represent the whole set of minimal recombination pathways leading to a new haplotype. We present an O(n(2)) algorithm that outputs such representative recombination pathways. We apply it to haplotypes of the 8 kb dystrophin gene segment dys44.


BACKGROUND
A software implementing the algorithm and some other extentions has been developed on a Java platform (JDK 1.3.1). It is freely available at http://www.iro.umontreal.ca/~mabrouk/
Département d'informatique et de recherche opérationnelle, Université de Montréal, CP 6128 Succursale Centre-ville, Montréal, QC, Canada H3C 3J7. mabrouk@iro.montreal.ca
Nadia
N
El-Mabrouk
Damian
D
Labuda
D000465:Algorithms; D002874:Chromosome Mapping / Q000379:methods*; D014644:Genetic Variation; D005828:Genetics, Population; D006239:Haplotypes / Q000235:genetics*; D008957:Models, Genetic; D011995:Recombination, Genetic / Q000235:genetics*; D016415:Sequence Alignment / Q000379:methods; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software