MoGUL: Detecting Common Insertions and Deletions in a Population

被引:0
|
作者
Lee, Seunghak [1 ,2 ]
Xing, Eric [2 ]
Brudno, Michael [1 ,3 ]
机构
[1] Univ Toronto, Dept Comp Sci, Toronto, ON M5S 1A1, Canada
[2] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA 15213 USA
[3] Univ Toronto, Banting & Best Dept Med Res, Toronto, ON, Canada
来源
RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY, PROCEEDINGS | 2010年 / 6044卷
关键词
STRUCTURAL VARIATION; HUMAN GENOME; DISCOVERY;
D O I
暂无
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
While the discovery of structural variants in the human population is ongoing, most methods for this task assume that the genome is sequenced to high coverage (e.g. 40x), and use the combined power of the many sequenced reads and mate pairs to identify the variants. In contrast, the 1000 Genomes Project hopes to sequence hundreds of human genotypes, but at low coverage (4-6x), and most of the current methods are unable to discover insertion/deletion and structural variants from this data. In order to identify indels from multiple low-coverage individuals we have developed the MoGUL (Mixture of Genotypes Variant Locator) framework, which identifies potential locations with indels by examining mate pairs generated from all sequenced individuals simultaneously, uses a Bayesian network with appropriate priors to explicitly model each individual as homozygous or heterozygous for each locus, and computes the expected Minor Allele Frequency (MAF) for all predicted variants. We have used MoGUL to identify variants in 1000 Genomes data, as well as in simulated genotypes, and show good accuracy at predicting indels, especially for MAF > 0.06 and indel size > 20 base pairs.
引用
收藏
页码:357 / +
页数:3
相关论文
共 50 条
  • [1] Detecting Deletions and Insertions in Concatenated Strings with Optimal Redundancy
    Hanna, Serge Kas
    Bitar, Rawad
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 1985 - 1990
  • [2] MAMnet: detecting and genotyping deletions and insertions based on long reads and a deep learning approach
    Ding, Hongyu
    Luo, Junwei
    BRIEFINGS IN BIOINFORMATICS, 2022, 23 (05)
  • [3] MECHANISM OF CONVERSION OF DELETIONS AND INSERTIONS
    RADDING, CM
    COLD SPRING HARBOR SYMPOSIA ON QUANTITATIVE BIOLOGY, 1979, 43 : 1315 - 1316
  • [4] On the List Decodability of Insertions and Deletions
    Hayashi, Tomohiro
    Yasunaga, Kenji
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 86 - 90
  • [5] Contextual insertions/deletions and computability
    Kari, L
    Thierrin, G
    INFORMATION AND COMPUTATION, 1996, 131 (01) : 47 - 61
  • [6] List Decoding of Insertions and Deletions
    Wachter-Zeh, Antonia
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (09) : 6297 - 6304
  • [7] On the List Decodability of Insertions and Deletions
    Hayashi, Tomohiro
    Yasunaga, Kenji
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (09) : 5335 - 5343
  • [8] Covering Codes for Insertions and Deletions
    Lenz, Andreas
    Rashtchian, Cyrus
    Siegel, Paul H.
    Yaakobi, Eitan
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 723 - 728
  • [9] CHILD: a new tool for detecting low-abundance insertions and deletions in standard sequence traces
    Zhidkov, Ilia
    Cohen, Raphael
    Geifman, Nophar
    Mishmar, Dan
    Rubin, Eitan
    NUCLEIC ACIDS RESEARCH, 2011, 39 (07) : E47 - U96
  • [10] Probabilistic Phylogenetic Inference with Insertions and Deletions
    Rivas, Elena
    Eddy, Sean R.
    PLOS COMPUTATIONAL BIOLOGY, 2008, 4 (09)