Evidence map›Paper›PMID 21349867›Full record

ArticleBioinformatics (Oxford, England)2011

Interactive, multiscale navigation of large and complicated biological networks.

Thanet Praneenararat, Toshihisa Takagi, Wataru Iwasaki

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

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

4 citing papers in PubMed.

  1. Modularity in Biological Networks.Frontiers in genetics · 2021
    Review
  2. Article
  3. Article
  4. 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.

Thanet PraneenararatDepartment of Computational Biology, The University of Tokyo, Kashiwa, Chiba 277-8568, Japan. thanet@cb.k.u-tokyo.ac.jp
Toshihisa Takagi
Wataru Iwasaki

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationMany types of omics data are compiled as lists of connections between elements and visualized as networks or graphs where the nodes and edges correspond to the elements and the connections, respectively. However, these networks often appear as 'hair-balls'-with a large number of extremely tangled edges-and cannot be visually interpreted.

resultsWe present an interactive, multiscale navigation method for biological networks. Our approach can automatically and rapidly abstract any portion of a large network of interest to an immediately interpretable extent. The method is based on an ultrafast graph clustering technique that abstracts networks of about 100 000 nodes in a second by iteratively grouping densely connected portions and a biological-property-based clustering technique that takes advantage of biological information often provided for biological entities (e.g. Gene Ontology terms). It was confirmed to be effective by applying it to real yeast protein network data, and would greatly help modern biologists faced with large, complicated networks in a similar manner to how Web mapping services enable interactive multiscale navigation of geographical maps (e.g. Google Maps). AVAILABILITY: Java implementation of our method, named NaviCluster, is available at http://navicluster.cb.k.u-tokyo.ac.jp/. CONTACT: thanet@cb.k.u-tokyo.ac.jp SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

Cluster AnalysisProtein Interaction MappingSaccharomyces cerevisiaeSaccharomyces cerevisiae ProteinsSoftwareUser-Computer InterfaceSaccharomyces cerevisiae Proteins

Identifiers

PMID21349867
PMCPMC3072549

What OpenQuestion holds

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