MOTIVATION: Recent advances in genotyping technology has made data acquisition for whole-genome association study cost effective, and a current active area of research is developing efficient methods to analyze such large-scale datasets. Most sophisticated association mapping methods that are currently available take phased haplotype data as input. However, phase information is not readily available from sequencing methods and inferring the phase via computational approaches is time-consuming, taking days to phase a single chromosome. RESULTS: In this article, we devise an efficient method for scanning unphased whole-genome data for association. Our approach combines a recently found linear-time algorithm for phasing genotypes on trees with a recently proposed tree-based method for association mapping. From unphased genotype data, our algorithm builds local phylogenies along the genome, and scores each tree according to the clustering of cases and controls. We assess the performance of our new method on both simulated and real biological datasets. AVAILABILITY: The software described in this article is available at http://www.daimi.au.dk/~mailund/Blossoc and distributed under the GNU General Public License.
MOTIVATION: Recent advances in genotyping technology has made data acquisition for whole-genome association study cost effective, and a current active area of research is developing efficient methods to analyze such large-scale datasets. Most sophisticated association mapping methods that are currently available take phased haplotype data as input. However, phase information is not readily available from sequencing methods and inferring the phase via computational approaches is time-consuming, taking days to phase a single chromosome. RESULTS: In this article, we devise an efficient method for scanning unphased whole-genome data for association. Our approach combines a recently found linear-time algorithm for phasing genotypes on trees with a recently proposed tree-based method for association mapping. From unphased genotype data, our algorithm builds local phylogenies along the genome, and scores each tree according to the clustering of cases and controls. We assess the performance of our new method on both simulated and real biological datasets. AVAILABILITY: The software described in this article is available at http://www.daimi.au.dk/~mailund/Blossoc and distributed under the GNU General Public License.
Authors: Clive J Hoggart; Marc Chadeau-Hyam; Taane G Clark; Riccardo Lampariello; John C Whittaker; Maria De Iorio; David J Balding Journal: Genetics Date: 2007-10-18 Impact factor: 4.562
Authors: Hon-Chung Fung; Sonja Scholz; Mar Matarin; Javier Simón-Sánchez; Dena Hernandez; Angela Britton; J Raphael Gibbs; Carl Langefeld; Matt L Stiegert; Jennifer Schymick; Michael S Okun; Ronald J Mandel; Hubert H Fernandez; Kelly D Foote; Ramón L Rodríguez; Elizabeth Peckham; Fabienne Wavrant De Vrieze; Katrina Gwinn-Hardy; John A Hardy; Andrew Singleton Journal: Lancet Neurol Date: 2006-11 Impact factor: 44.182
Authors: Michael W Lutz; Donna Crenshaw; Kathleen A Welsh-Bohmer; Daniel K Burns; Allen D Roses Journal: Curr Neurol Neurosci Rep Date: 2016-05 Impact factor: 5.081