Minimum Conflict Individual Haplotyping from SNP Fragments and Related Genotype
The Minimum Error Correction (MEC) is an important model for haplotype reconstruction from SNP fragments. However, this model is effective only when the error rate of SNP fragments is low. In this paper, we propose a new computational model called Minimum Conflict Individual Haplotyping (MCIH) as an...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2006-01-01
|
Series: | Evolutionary Bioinformatics |
Online Access: | https://doi.org/10.1177/117693430600200032 |
id |
doaj-4ec3f358a10f42dfb33a88db605871ec |
---|---|
record_format |
Article |
spelling |
doaj-4ec3f358a10f42dfb33a88db605871ec2020-11-25T03:24:45ZengSAGE PublishingEvolutionary Bioinformatics1176-93432006-01-01210.1177/117693430600200032Minimum Conflict Individual Haplotyping from SNP Fragments and Related GenotypeXiang-Sun Zhang0Rui-Sheng Wang1Ling-Yun Wu2Wei Zhang3Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China.School of Information, Renmin University of China, Beijing 100872.Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China.North Carolina State University, Raleigh, NC 27695-7906, U.S.A.The Minimum Error Correction (MEC) is an important model for haplotype reconstruction from SNP fragments. However, this model is effective only when the error rate of SNP fragments is low. In this paper, we propose a new computational model called Minimum Conflict Individual Haplotyping (MCIH) as an extension to MEC. In contrast to the conventional approaches, the new model employs SNP fragment information and also related genotype information, thereby a high accurate inference can be expected. We first prove the MCIH problem to be NP-hard. To evaluate the practicality of the new model we design an exact algorithm (a dynamic programming procedure) to implement MCIH on a special data structure. The numerical experience indicates that it is fairly effective to use MCIH at the cost of related genotype information, especially in the case of SNP fragments with a high error rate. Moreover, we present a feed-forward neural network algorithm to solve MCIH for general data structure and large size instances. Numerical results on real biological data and simulation data show that the algorithm works well and MCIH is a potential alternative in individual haplotyping.https://doi.org/10.1177/117693430600200032 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Xiang-Sun Zhang Rui-Sheng Wang Ling-Yun Wu Wei Zhang |
spellingShingle |
Xiang-Sun Zhang Rui-Sheng Wang Ling-Yun Wu Wei Zhang Minimum Conflict Individual Haplotyping from SNP Fragments and Related Genotype Evolutionary Bioinformatics |
author_facet |
Xiang-Sun Zhang Rui-Sheng Wang Ling-Yun Wu Wei Zhang |
author_sort |
Xiang-Sun Zhang |
title |
Minimum Conflict Individual Haplotyping from SNP Fragments and Related Genotype |
title_short |
Minimum Conflict Individual Haplotyping from SNP Fragments and Related Genotype |
title_full |
Minimum Conflict Individual Haplotyping from SNP Fragments and Related Genotype |
title_fullStr |
Minimum Conflict Individual Haplotyping from SNP Fragments and Related Genotype |
title_full_unstemmed |
Minimum Conflict Individual Haplotyping from SNP Fragments and Related Genotype |
title_sort |
minimum conflict individual haplotyping from snp fragments and related genotype |
publisher |
SAGE Publishing |
series |
Evolutionary Bioinformatics |
issn |
1176-9343 |
publishDate |
2006-01-01 |
description |
The Minimum Error Correction (MEC) is an important model for haplotype reconstruction from SNP fragments. However, this model is effective only when the error rate of SNP fragments is low. In this paper, we propose a new computational model called Minimum Conflict Individual Haplotyping (MCIH) as an extension to MEC. In contrast to the conventional approaches, the new model employs SNP fragment information and also related genotype information, thereby a high accurate inference can be expected. We first prove the MCIH problem to be NP-hard. To evaluate the practicality of the new model we design an exact algorithm (a dynamic programming procedure) to implement MCIH on a special data structure. The numerical experience indicates that it is fairly effective to use MCIH at the cost of related genotype information, especially in the case of SNP fragments with a high error rate. Moreover, we present a feed-forward neural network algorithm to solve MCIH for general data structure and large size instances. Numerical results on real biological data and simulation data show that the algorithm works well and MCIH is a potential alternative in individual haplotyping. |
url |
https://doi.org/10.1177/117693430600200032 |
work_keys_str_mv |
AT xiangsunzhang minimumconflictindividualhaplotypingfromsnpfragmentsandrelatedgenotype AT ruishengwang minimumconflictindividualhaplotypingfromsnpfragmentsandrelatedgenotype AT lingyunwu minimumconflictindividualhaplotypingfromsnpfragmentsandrelatedgenotype AT weizhang minimumconflictindividualhaplotypingfromsnpfragmentsandrelatedgenotype |
_version_ |
1724600122585645056 |