Evidence map›Paper›PMID 21346997›Full record

ArticleAMIA ... Annual Symposium proceedings. AMIA Symposium2010

A fast algorithm for learning epistatic genomic relationships.

Xia Jiang, Richard E Neapolitan, M Michael Barmada, Shyam Visweswaran, Gregory F Cooper

Abstract read
In one paragraph

Article in AMIA ... Annual Symposium proceedings. AMIA Symposium, 2010. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 19 papers.

0numbers the graph read from it
0cells of the map it votes in
19citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

19 citing papers in PubMed.

  1. New Algorithm and Software (BNOmics) for Inferring and Visualizing Bayesian Networks from Heterogeneous Big Biological and Genetic Data.Journal of computational biology : a journal of computational molecular cell biology · 2017
    Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Review
  12. Article
  13. Article
  14. Article
  15. Article
  16. Review
  17. Article
  18. Evaluating de novo locus-disease discoveries in GWAS using the signal-to-noise ratio.AMIA ... Annual Symposium proceedings. AMIA Symposium · 2011
    Article
  19. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Xia JiangDepartment of Biomedical Informatics, University of Pittsburgh, Pittsburgh, PA.
Richard E Neapolitan
M Michael Barmada
Shyam Visweswaran
Gregory F Cooper

Funding

The internship in Biomedical Research, Informatics, and Computer Science (iBRIC): Biomedical Informatics and Data Science research experiences for students from Minority Serving InstitutionsT15LM007059 · NLM · UNIVERSITY OF PITTSBURGH AT PITTSBURGH · PI HARRY S HOCHHEISER · 1987 to 2026
$23.9M
Predicting Patient Outcomes from Clinical and Genome-Wide DataR01LM010020 · NLM · UNIVERSITY OF PITTSBURGH AT PITTSBURGH · PI COOPER, GREGORY F. · 2009 to 2010
$1.2M
Detecting Genome Wide Epistasis with Efficient Bayesian Network LearningR00LM010822 · NLM · UNIVERSITY OF PITTSBURGH AT PITTSBURGH · PI JIANG, XIA · 2012 to 2014
$565k
Detecting Genome Wide Epistasis with Efficient Bayesian Network LearningK99LM010822 · NLM · UNIVERSITY OF PITTSBURGH AT PITTSBURGH · PI JIANG, XIA · 2010 to 2011
$180k
NLM NIH HHS K99 LM010822NLM NIH HHS R00 LM010822NLM NIH HHS R01 LM010020NLM NIH HHS T15 LM007059
6 · The paper itself

Abstract

Genetic epidemiologists strive to determine the genetic profile of diseases. Epistasis is the interaction between two or more genes to affect phenotype. Due to the often non-linearity of the interaction, it is difficult to detect statistical patterns of epistasis. Combinatorial methods for detecting epistasis investigate a subset of combinations of genes without employing a search strategy. Therefore, they do not scale to handling the high-dimensional data found in genome-wide association studies (GWAS). We represent genome-phenome interactions using a Bayesian network rule, which is a specialized Bayesian network. We develop an efficient search algorithm to learn from data a high scoring rule that may contain two or more interacting genes. Our experimental results using synthetic data indicate that this algorithm detects interacting genes as well as a Bayesian network combinatorial method, and it is much faster. Our results also indicate that the algorithm can successfully learn genome-phenome relationships using a real GWAS dataset.

Indexed as

Bayes TheoremGenome-Wide Association StudyAlgorithmsEpistasis, GeneticGenomicsHumansPolymorphism, Single Nucleotide

Identifiers

PMID21346997
PMCPMC3041370

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.