Detection of copy number variation from next generation sequencing data with total variation penalized least square optimization

Junbo Duan, Ji-Gang Zhang, J. Lefante, H. Deng, Yu-ping Wang
{"title":"Detection of copy number variation from next generation sequencing data with total variation penalized least square optimization","authors":"Junbo Duan, Ji-Gang Zhang, J. Lefante, H. Deng, Yu-ping Wang","doi":"10.1109/BIBMW.2011.6112348","DOIUrl":null,"url":null,"abstract":"The detection of copy number variation is important to understand complex diseases such as autism, schizophrenia, cancer, etc. In this paper we propose a method to detect copy number variation from next generation sequencing data. Compared with conventional methods to detect copy number variation like array comparative genomic hybridization (aCGH), the next generation sequencing data provide higher resolution of genomic variations. There are a lot of methods to detect copy number variation from next sequencing data, and most of them are based on statistical hypothesis testing. In this paper, we consider this problem from an optimization point of view. The proposed method is based on optimizing a total variation penalized least square criterion, which involves ℓ-1 norm. Inspired by the analytical study of a statics system, we propose an iterative algorithm to find the optimal solution of this optimization problem. The comparative study with other existing methods on simulated data demonstrates that our method can detect relatively small copy number variants (low copy number and small single copy length) with low false positive rate.","PeriodicalId":6345,"journal":{"name":"2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)","volume":"46 1","pages":"3-12"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIBMW.2011.6112348","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

The detection of copy number variation is important to understand complex diseases such as autism, schizophrenia, cancer, etc. In this paper we propose a method to detect copy number variation from next generation sequencing data. Compared with conventional methods to detect copy number variation like array comparative genomic hybridization (aCGH), the next generation sequencing data provide higher resolution of genomic variations. There are a lot of methods to detect copy number variation from next sequencing data, and most of them are based on statistical hypothesis testing. In this paper, we consider this problem from an optimization point of view. The proposed method is based on optimizing a total variation penalized least square criterion, which involves ℓ-1 norm. Inspired by the analytical study of a statics system, we propose an iterative algorithm to find the optimal solution of this optimization problem. The comparative study with other existing methods on simulated data demonstrates that our method can detect relatively small copy number variants (low copy number and small single copy length) with low false positive rate.
从总变异的下一代测序数据中检测拷贝数变异惩罚最小二乘优化
拷贝数变异的检测对于了解自闭症、精神分裂症、癌症等复杂疾病具有重要意义。本文提出了一种从下一代测序数据中检测拷贝数变异的方法。与阵列比较基因组杂交(aCGH)等传统的拷贝数变异检测方法相比,下一代测序数据提供了更高的基因组变异分辨率。从下一次测序数据中检测拷贝数变异的方法有很多,但大多数都是基于统计假设检验。本文从最优化的角度来考虑这一问题。该方法基于优化一个总变差惩罚最小二乘准则,该准则涉及到1 -1范数。受静态系统分析研究的启发,我们提出了一种迭代算法来求解这一优化问题的最优解。与现有方法在模拟数据上的对比研究表明,我们的方法可以检测到相对较小的拷贝数变异(低拷贝数和小单拷贝长度),并且假阳性率较低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信