Evidence map›Paper›PMID 21625554›Full record

ArticlePloS one2011

A gene-phenotype network for the laboratory mouse and its implications for systematic phenotyping.

Octavio Espinosa, John M Hancock

Open access · goldAbstract read
In one paragraph

Article in PloS one, 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers.

0numbers the graph read from it
0cells of the map it votes in
8citing papers in PubMed
1.6field-weighted citation impact, top 18% of its field
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

8 citing papers in PubMed, 15 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Computational tools for comparative phenomics: the role and promise of ontologies.Mammalian genome : official journal of the International Mammalian Genome Society · 2012
    Review
  6. Review
  7. Article
  8. Review
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

2 authors at 1 institution in 1 country.

Octavio EspinosaBioinformatics Group, MRC Mammalian Genetics Unit, Harwell, Oxfordshire, United Kingdom.
John M Hancock
Mary Lyon Centre at MRC Harwell · GB

Funding

Medical Research Council MC_U142684171
6 · The paper itself

Abstract

The laboratory mouse is the pre-eminent model organism for the dissection of human disease pathways. With the advent of a comprehensive panel of gene knockouts, projects to characterise the phenotypes of all knockout lines are being initiated. The range of genotype-phenotype associations can be represented using the Mammalian Phenotype ontology. Using publicly available data annotated with this ontology we have constructed gene and phenotype networks representing these associations. These networks show a scale-free, hierarchical and modular character and community structure. They also exhibit enrichment for gene coexpression, protein-protein interactions and Gene Ontology annotation similarity. Close association between gene communities and some high-level ontology terms suggests that systematic phenotyping can provide a direct insight into underlying pathways. However some phenotypes are distributed more diffusely across gene networks, likely reflecting the pleiotropic roles of many genes. Phenotype communities show a many-to-many relationship to human disease communities, but stronger overlap at more granular levels of description. This may suggest that systematic phenotyping projects should aim for high granularity annotations to maximise their relevance to human disease.

Indexed as

Computational BiologyGene Regulatory NetworksGenetic Association StudiesPhenotypeAnimalsDatabases, GeneticGenesHumansMiceMolecular Sequence AnnotationPhylogeny

Identifiers

PMID21625554
PMCPMC3098258
OpenAlexW2019947019

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.