Junbo Duan, Ji-Gang Zhang, J. Lefante, H. Deng, Yu-ping Wang
{"title":"从总变异的下一代测序数据中检测拷贝数变异惩罚最小二乘优化","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":"{\"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}","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}
Detection of copy number variation from next generation sequencing data with total variation penalized least square optimization
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.