Evidence map›Paper›PMID 29813080›Full record

ArticlePloS one2018

Efficient methods and readily customizable libraries for managing complexity of large networks.

Ugur Dogrusoz, Alper Karacelik, Ilkin Safarli, Hasan Balci, Leonard Dervishi, Metin Can Siper

Abstract read
In one paragraph

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

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

2 citing papers in PubMed.

  1. Article
  2. 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

6 authors.

Ugur DogrusozComputer Engineering Dept., Bilkent University, Ankara 06800, Turkey.ORCID 0000-0002-7153-0784
Alper KaracelikComputer Engineering Dept., Bilkent University, Ankara 06800, Turkey.
Ilkin SafarliComputer Engineering Dept., Bilkent University, Ankara 06800, Turkey.
Hasan BalciComputer Engineering Dept., Bilkent University, Ankara 06800, Turkey.
Leonard DervishiComputer Engineering Dept., Bilkent University, Ankara 06800, Turkey.
Metin Can SiperComputer Engineering Dept., Bilkent University, Ankara 06800, Turkey.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundOne common problem in visualizing real-life networks, including biological pathways, is the large size of these networks. Often times, users find themselves facing slow, non-scaling operations due to network size, if not a "hairball" network, hindering effective analysis. One extremely useful method for reducing complexity of large networks is the use of hierarchical clustering and nesting, and applying expand-collapse operations on demand during analysis. Another such method is hiding currently unnecessary details, to later gradually reveal on demand. Major challenges when applying complexity reduction operations on large networks include efficiency and maintaining the user's mental map of the drawing.

resultsWe developed specialized incremental layout methods for preserving a user's mental map while managing complexity of large networks through expand-collapse and hide-show operations. We also developed open-source JavaScript libraries as plug-ins to the web based graph visualization library named Cytsocape.js to implement these methods as complexity management operations. Through efficient specialized algorithms provided by these extensions, one can collapse or hide desired parts of a network, yielding potentially much smaller networks, making them more suitable for interactive visual analysis.

conclusionThis work fills an important gap by making efficient implementations of some already known complexity management techniques freely available to tool developers through a couple of open source, customizable software libraries, and by introducing some heuristics which can be applied upon such complexity management techniques to ensure preserving mental map of users.

Indexed as

Computer GraphicsSoftwareAlgorithmsCluster AnalysisHeuristicsHumansModels, Theoretical

Identifiers

PMID29813080
PMCPMC5973603

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.