Evidence map›Paper›PMID 17042942›Full record

ArticleBMC bioinformatics2006

Whole genome association mapping by incompatibilities and local perfect phylogenies.

Thomas Mailund, Søren Besenbacher, Mikkel H Schierup

Abstract readEvaluation Study
In one paragraph

Article in BMC bioinformatics, 2006. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 25 papers.

0numbers the graph read from it
0cells of the map it votes in
25citing 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

25 citing papers in PubMed.

  1. Article
  2. Article
  3. Tree-based QTL mapping with expected local genetic relatedness matrices.bioRxiv : the preprint server for biology · 2023
    Article
  4. Article
  5. New Genetic Approaches to AD: Lessons from APOE-TOMM40 Phylogenetics.Current neurology and neuroscience reports · 2016
    Review
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Genome-wide compatible SNP intervals and their properties.The 2010 ACM International Conference on Bioinformatics and Computational Biology : ACM-BCB 2010 : Niagara Falls, New York, U.S.A., August 2-4, 2010. ACM International Conference on Bioinformatics and Computational Biology (1st : 2010 :... · 2010
    Article
  16. Inferring combined CNV/SNP haplotypes from genotype data.Bioinformatics (Oxford, England) · 2010
    Article
  17. Article
  18. Article
  19. Article
  20. 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

3 authors.

Thomas MailundDepartment of Statistics, University of Oxford, UK. mailund@stats.ox.ac.uk
Søren Besenbacher
Mikkel H Schierup

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundWith current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of studies, fast and efficient analysis methods that scale to such data set sizes must be developed.

resultsWe present a fast method for accurate localisation of disease causing variants in high density case-control association mapping experiments with large numbers of cases and controls. The method searches for significant clustering of case chromosomes in the "perfect" phylogenetic tree defined by the largest region around each marker that is compatible with a single phylogenetic tree. This perfect phylogenetic tree is treated as a decision tree for determining disease status, and scored by its accuracy as a decision tree. The rationale for this is that the perfect phylogeny near a disease affecting mutation should provide more information about the affected/unaffected classification than random trees. If regions of compatibility contain few markers, due to e.g. large marker spacing, the algorithm can allow the inclusion of incompatibility markers in order to enlarge the regions prior to estimating their phylogeny. Haplotype data and phased genotype data can be analysed. The power and efficiency of the method is investigated on 1) simulated genotype data under different models of disease determination 2) artificial data sets created from the HapMap ressource, and 3) data sets used for testing of other methods in order to compare with these. Our method has the same accuracy as single marker association (SMA) in the simplest case of a single disease causing mutation and a constant recombination rate. However, when it comes to more complex scenarios of mutation heterogeneity and more complex haplotype structure such as found in the HapMap data our method outperforms SMA as well as other fast, data mining approaches such as HapMiner and Haplotype Pattern Mining (HPM) despite being significantly faster. For unphased genotype data, an initial step of estimating the phase only slightly decreases the power of the method. The method was also found to accurately localise the known susceptibility variants in an empirical data set--the DeltaF508 mutation for cystic fibrosis--where the susceptibility variant is already known--and to find significant signals for association between the CYP2D6 gene and poor drug metabolism, although for this dataset the highest association score is about 60 kb from the CYP2D6 gene.

conclusionOur method has been implemented in the Blossoc (BLOck aSSOCiation) software. Using Blossoc, genome wide chip-based surveys of 3 million SNPs in 1000 cases and 1000 controls can be analysed in less than two CPU hours.

Indexed as

Chromosome MappingCystic FibrosisCytochrome P-450 CYP2D6DNA Mutational AnalysisGenetic Predisposition to DiseaseHumansLinkage DisequilibriumPhylogenyPolymorphism, Single NucleotideCytochrome P-450 CYP2D6

Identifiers

PMID17042942
PMCPMC1624851

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.