2019
DOI: 10.1101/745612
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

PlotTwist - a web app for plotting and annotating time-series data

Abstract: The results from time-dependent experiments are often used to generate plots that visualize how the data evolves over time. To simplify state-of-the-art data visualization and annotation of data from such experiments, an open source tool was created with R/shiny that does not require coding skills to operate. The freely available web app accepts wide (spreadsheet) and tidy data and offers a range of options to normalize the data. The data from individual objects can be shown in three different ways: (i) lines … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 15 publications
0
6
0
Order By: Relevance
“…All graphs for data visualization, unless stated otherwise, were plotted using PlotTwist (80) and PlotsOfData (81).…”
Section: Data Visualizationmentioning
confidence: 99%
“…All graphs for data visualization, unless stated otherwise, were plotted using PlotTwist (80) and PlotsOfData (81).…”
Section: Data Visualizationmentioning
confidence: 99%
“…Background subtractions, bleedthrough correction and calculation of the normalized ratio per time point per cell were done in Excel (Microsoft Office). All plots were prepared with the PlotTwist web app (Goedhart 2019). Plots show the average response as a thicker line and a ribbon for the 95% confidence interval around the mean.…”
Section: Image Analysis and Data Visualizationmentioning
confidence: 99%
“…Three centrality measurements were calculated: (i) degree centrality, which computes the number of edges linked to each node so that a node with degree 5 has 5 edges associated, that is, it is linked to 5 other nodes ( 32 ); (ii) closeness centrality, which corresponds to the average shortest path length of one node to every other node computed by the Newman method ( 33 ), where 0 means an isolated node and 1 is the highest centrality and connectivity; and (iii) betweenness centrality, which is the probability of passing through a node when using the shortest path length between two nodes and is computed with the highly precise algorithm developed by Brandes ( 34 ) to distinguish nodes critical to maintain a network. The three measurements of centrality were visualized as three-dimensional (3D) plots using R ( 94 ).…”
Section: Methodsmentioning
confidence: 99%