Solving MEC model of haplotype reconstruction using information fusion, single greedy and parallel clustering approaches

E. Asgarian, M. Moeinzadeh, S. Sharifian-R, A. Najafi-Ardabili, A. Ramezani, J. Habibi, J. Mohammadzadeh
{"title":"Solving MEC model of haplotype reconstruction using information fusion, single greedy and parallel clustering approaches","authors":"E. Asgarian, M. Moeinzadeh, S. Sharifian-R, A. Najafi-Ardabili, A. Ramezani, J. Habibi, J. Mohammadzadeh","doi":"10.1109/AICCSA.2008.4493511","DOIUrl":null,"url":null,"abstract":"Haplotype information has become increasingly important in analyzing fine-scale molecular genetics data, Due to the mutated form in human genome; SNPs (Single Nucleotide Polymorphism) are responsible for some genetic diseases. As a consequence, obtaining all SNPs from human populations is one of the primary goals of studies in human genomics. In this paper, a data fusion method based on multiple parallel classifiers for reconstruction of haplotypes from a given sample Single Nucleotide Polymorphism (SNP) is proposed. First, we design a single greedy algorithm for solving haplotype reconstructions. [2] is used as an efficient approach to be combined with first classification method. The methods and information fusion approach are aimed specifically for increasing reconstruction rate of the problem in Minimum Error Correction Model (MEC) which is one of haplotyping problem models belonging to NP-hard class. Designing a parallel classifier, which helps us cover the single classifier's weaknesses, was the focus of our research.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE/ACS International Conference on Computer Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICCSA.2008.4493511","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Haplotype information has become increasingly important in analyzing fine-scale molecular genetics data, Due to the mutated form in human genome; SNPs (Single Nucleotide Polymorphism) are responsible for some genetic diseases. As a consequence, obtaining all SNPs from human populations is one of the primary goals of studies in human genomics. In this paper, a data fusion method based on multiple parallel classifiers for reconstruction of haplotypes from a given sample Single Nucleotide Polymorphism (SNP) is proposed. First, we design a single greedy algorithm for solving haplotype reconstructions. [2] is used as an efficient approach to be combined with first classification method. The methods and information fusion approach are aimed specifically for increasing reconstruction rate of the problem in Minimum Error Correction Model (MEC) which is one of haplotyping problem models belonging to NP-hard class. Designing a parallel classifier, which helps us cover the single classifier's weaknesses, was the focus of our research.
利用信息融合、单贪婪和并行聚类方法求解单倍型重构MEC模型
由于人类基因组中的突变形式,单倍型信息在精细分子遗传学数据分析中变得越来越重要;单核苷酸多态性(SNPs)是导致一些遗传疾病的原因。因此,从人类群体中获得所有snp是人类基因组学研究的主要目标之一。本文提出了一种基于多个并行分类器的数据融合方法,用于单核苷酸多态性(Single Nucleotide Polymorphism, SNP)的单倍型重构。首先,我们设计了一个求解单倍型重构的贪心算法。[2]作为一种与第一种分类方法相结合的有效方法。最小误差修正模型(Minimum Error Correction Model, MEC)是属于NP-hard类的单倍型问题模型之一,该方法和信息融合方法专门针对提高问题的重构率。设计一个并行分类器,这有助于我们覆盖单一分类器的弱点,是我们研究的重点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书