DELISHUS: an efficient and exact algorithm for genome-wide detection of deletion polymorphism in autism (bibtex)
by Derek Aguiar, Bjarni V. Halldorsson, Eric M. Morrow, Sorin Istrail
Abstract:
Motivation: The understanding of the genetic determinants of complex disease is undergoing a paradigm shift. Genetic heterogeneity of rare mutations with deleterious effects is more commonly being viewed as a major component of disease. Autism is an excellent example where research is active in identifying matches between the phenotypic and genomic heterogeneities. A considerable portion of autism appears to be correlated with copy number variation, which is not directly probed by single nucleotide polymorphism (SNP) array or sequencing technologies. Identifying the genetic heterogeneity of small deletions remains a major unresolved computational problem partly due to the inability of algorithms to detect them.Results: In this article, we present an algorithmic framework, which we term DELISHUS, that implements three exact algorithms for inferring regions of hemizygosity containing genomic deletions of all sizes and frequencies in SNP genotype data. We implement an efficient backtracking algorithm—that processes a 1 billion entry genome-wide association study SNP matrix in a few minutes—to compute all inherited deletions in a dataset. We further extend our model to give an efficient algorithm for detecting de novo deletions. Finally, given a set of called deletions, we also give a polynomial time algorithm for computing the critical regions of recurrent deletions. DELISHUS achieves significantly lower false-positive rates and higher power than previously published algorithms partly because it considers all individuals in the sample simultaneously. DELISHUS may be applied to SNP array or sequencing data to identify the deletion spectrum for family-based association studies.Availability: DELISHUS is available at http://www.brown.edu/Research/Istrail_Lab/.Contact: Eric_Morrow@brown.edu and Sorin_Istrail@brown.eduSupplementary information: Supplementary data are available at Bioinformatics online.
Reference:
Derek Aguiar, Bjarni V. Halldorsson, Eric M. Morrow, Sorin Istrail, "DELISHUS: an efficient and exact algorithm for genome-wide detection of deletion polymorphism in autism", In Bioinformatics, vol. 28, no. 12, pp. i154-i162, 2012.
Bibtex Entry:
@article{Aguiar2012,
author = {Aguiar, Derek and Halldorsson, Bjarni V. and Morrow, Eric M. and Istrail, Sorin}, 
title = {DELISHUS: an efficient and exact algorithm for genome-wide detection of deletion polymorphism in autism},
volume = {28}, 
number = {12}, 
pages = {i154-i162}, 
year = {2012}, 
doi = {10.1093/bioinformatics/bts234}, 
abstract ={Motivation: The understanding of the genetic determinants of complex disease is undergoing a paradigm shift. Genetic heterogeneity of rare mutations with deleterious effects is more commonly being viewed as a major component of disease. Autism is an excellent example where research is active in identifying matches between the phenotypic and genomic heterogeneities. A considerable portion of autism appears to be correlated with copy number variation, which is not directly probed by single nucleotide polymorphism (SNP) array or sequencing technologies. Identifying the genetic heterogeneity of small deletions remains a major unresolved computational problem partly due to the inability of algorithms to detect them.Results: In this article, we present an algorithmic framework, which we term DELISHUS, that implements three exact algorithms for inferring regions of hemizygosity containing genomic deletions of all sizes and frequencies in SNP genotype data. We implement an efficient backtracking algorithm—that processes a 1 billion entry genome-wide association study SNP matrix in a few minutes—to compute all inherited deletions in a dataset. We further extend our model to give an efficient algorithm for detecting de novo deletions. Finally, given a set of called deletions, we also give a polynomial time algorithm for computing the critical regions of recurrent deletions. DELISHUS achieves significantly lower false-positive rates and higher power than previously published algorithms partly because it considers all individuals in the sample simultaneously. DELISHUS may be applied to SNP array or sequencing data to identify the deletion spectrum for family-based association studies.Availability: DELISHUS is available at http://www.brown.edu/Research/Istrail_Lab/.Contact: Eric_Morrow@brown.edu and Sorin_Istrail@brown.eduSupplementary information: Supplementary data are available at Bioinformatics online.}, 
URL = {http://bioinformatics.oxfordjournals.org/content/28/12/i154.abstract}, 
eprint = {http://bioinformatics.oxfordjournals.org/content/28/12/i154.full.pdf+html}, 
journal = {Bioinformatics},
  url = {http://www.brown.edu/Research/Istrail_Lab/papers/Aguiar.245.pdf},
  category = {Deletion Inference, Haplotype Analysis}
}
Powered by bibtexbrowser