Skip Navigation

Bioinformatics 2005 21(Suppl 2):ii173-ii179; doi:10.1093/bioinformatics/bti1128
This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Lajoie, M.
Right arrow Articles by El-Mabrouk, N.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Lajoie, M.
Right arrow Articles by El-Mabrouk, N.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions{at}oxfordjournals.org

Recovering haplotype structure through recombination and gene conversion

Mathieu Lajoie and Nadia El-Mabrouk *

Département d'Informatique et de Recherche Opérationnelle, Université de Montréal CP 6128 Succursale Centre-ville, Montréal, QC H3C 3J7, Canada

*To whom correspondence should be addressed.

Motivation: Understanding haplotype evolution subject to mutation, recombination and gene conversion is fundamental to understand genetic specificities of human populations and hereditary bases of complex disorders. The goal of this project is to develop new algorithmic tools assisting the reconstruction of historical relationships between haplotypes and the inference of haplotypes from genotypes.

Results: We present two new algorithms. The first one finds an optimal pathway of mutations, recombinations and gene conversions leading to a given haplotype of size m from a population of h haplotypes. It runs in time O(mhs2), where s is the maximum number of contiguous sites that can be exchanged in a single gene conversion. The second one finds an optimal pathway of mutations and recombinations leading to a given genotype, and runs in time O(mh2). Both algorithms are based on a penalty score model and use a dynamic programming approach. We apply the second one to the problem of inferring haplotypes from genotypes, and show how it can be used as an independent tool, or to improve the performance of existing methods.

Availability: The algorithms have been implemented in JAVA and are available on request.

Contact: mabrouk{at}iro.umontreal.ca


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 BioinformaticsHome page
D. M. Toleno, P. L. Morrell, and M. T. Clegg
Error detection in SNP data by considering the likelihood of recombinational history implied by three-site combinations
Bioinformatics, July 15, 2007; 23(14): 1807 - 1814.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
J. Maydt and T. Lengauer
Recco: recombination analysis using cost optimization
Bioinformatics, May 1, 2006; 22(9): 1064 - 1071.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.