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 |
Subjects: | |
Online Access: | http://la-press.com/article.php?article_id=133 |
id |
doaj-8c60769e73c44b519927d780a2ededed |
---|---|
record_format |
Article |
spelling |
doaj-8c60769e73c44b519927d780a2ededed2020-11-25T03:17:11ZengSAGE PublishingEvolutionary Bioinformatics1176-93432006-01-012261270Minimum Conflict Individual Haplotyping from SNP Fragments and Related GenotypeLing-Yun WuRui-Sheng WangXiang-Sun ZhangWei ZhangThe 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.http://la-press.com/article.php?article_id=133individual haplotypingminimum conflict individual haplotypingNP-harddynamic programmingfeedforward neural networkreconstruction rate |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Ling-Yun Wu Rui-Sheng Wang Xiang-Sun Zhang Wei Zhang |
spellingShingle |
Ling-Yun Wu Rui-Sheng Wang Xiang-Sun Zhang Wei Zhang Minimum Conflict Individual Haplotyping from SNP Fragments and Related Genotype Evolutionary Bioinformatics individual haplotyping minimum conflict individual haplotyping NP-hard dynamic programming feedforward neural network reconstruction rate |
author_facet |
Ling-Yun Wu Rui-Sheng Wang Xiang-Sun Zhang Wei Zhang |
author_sort |
Ling-Yun Wu |
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. |
topic |
individual haplotyping minimum conflict individual haplotyping NP-hard dynamic programming feedforward neural network reconstruction rate |
url |
http://la-press.com/article.php?article_id=133 |
work_keys_str_mv |
AT lingyunwu minimumconflictindividualhaplotypingfromsnpfragmentsandrelatedgenotype AT ruishengwang minimumconflictindividualhaplotypingfromsnpfragmentsandrelatedgenotype AT xiangsunzhang minimumconflictindividualhaplotypingfromsnpfragmentsandrelatedgenotype AT weizhang minimumconflictindividualhaplotypingfromsnpfragmentsandrelatedgenotype |
_version_ |
1724632866808135680 |