Tapadar, Pradip, Ghosh, Saurabh, Majumder, Partha P. (2000) Haplotyping in Pedigrees via a Genetic Algorithm. Human Heredity, 50 (1). pp. 43-56. ISSN 0001-5652. (doi:10.1159/000022890) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:4755)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: http://dx.doi.org/10.1159/000022890 |
Abstract
Genome-wide screening for localization of disease genes necessitates the efficient reconstruction of haplotypes of members of a pedigree from genotype data at multiple loci. We propose a genetic algorithmic approach to haplotyping and show that it works fast, efficiently and reliably. This algorithm uses certain principles of biological evolution to find optimal solutions to complex problems. The optimality criterion used in the present problem is the minimum number of recombinations over possible haplotype configurations of members of a pedigree. The proposed algorithm is much less demanding in terms of data and assumption requirements compared to the currently used likelihood-based methods of haplotype reconstruction. It also provides multiple optimal haplotype configurations of a pedigree, if such multiple optima exist.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1159/000022890 |
Subjects: | Q Science > QA Mathematics (inc Computing science) |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Mathematics, Statistics and Actuarial Science |
Depositing User: | Pradip Tapadar |
Date Deposited: | 27 May 2009 05:44 UTC |
Last Modified: | 05 Nov 2024 09:36 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/4755 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):