Open-source analysis and visualization of segmented vasculature datasets with VesselVio

JR Bumgarner, RJ Nelson - Cell reports methods, 2022 - cell.com
Vascular networks are fundamental components of biological systems. Quantitative analysis
and observation of the features of these networks can improve our understanding of their …

The mouse retina in 3D: quantification of vascular growth and remodeling

F Milde, S Lauw, P Koumoutsakos… - Integrative …, 2013 - academic.oup.com
The mouse retina has become a prominent model for studying angiogenesis. The easy
access and well-known developmental progression have significantly propelled our ability to …

[HTML][HTML] Three-dimensional imaging coupled with topological quantification uncovers retinal vascular plexuses undergoing obliteration

CC Chang, A Chu, S Meyer, Y Ding, MM Sun, P Abiri… - Theranostics, 2021 - ncbi.nlm.nih.gov
Introduction: Murine models provide microvascular insights into the 3-D network disarray
seen in retinopathy and cardiovascular diseases. Light-sheet fluorescence microscopy …

Identifying influential nodes in a wound healing-related network of biological processes using mean first-passage time

T Arodz, D Bonchev - New Journal of Physics, 2015 - iopscience.iop.org
In this study we offer an approach to network physiology, which proceeds from
transcriptomic data and uses gene ontology analysis to identify the biological processes …

Invariants of distance k-graphs for graph embedding

W Czech - Pattern Recognition Letters, 2012 - Elsevier
Graph comparison algorithms based on metric space embedding have been proven robust
in graph clustering and classification. In this paper we propose graph embedding method …

Application of Graph Neural Networks and graph descriptors for graph classification

J Adamczyk - arXiv preprint arXiv:2211.03666, 2022 - arxiv.org
Graph classification is an important area in both modern research and industry. Multiple
applications, especially in chemistry and novel drug discovery, encourage rapid …

[PDF][PDF] Construction of near-optimal vertex clique covering for real-world networks

D Chalupa - Computing and Informatics, 2015 - cai.sk
We propose a method based on combining a constructive and a bounding heuristic to solve
the vertex clique covering problem (CCP), where the aim is to partition the vertices of a …

ivga: Visualization of the network of historical events

W Dzwinel, R Wcisło, M Strzoda - … of the 1st International Conference on …, 2017 - dl.acm.org
There are many tools for the analysis of social networks such as the algorithms for
community detection. However, visualization of these networks enables not only to …

Graph descriptors from B-matrix representation

W Czech - … Workshop on Graph-Based Representations in Pattern …, 2011 - Springer
In this paper we propose graph descriptors derived from B-matrices, which are built on the
basis of distances between graph vertices. The B-matrices, being invariant under graph …

[PDF][PDF] Analysis of Iterated Greedy Heuristic for Vertex Clique Covering

D Chalupa, J Pospíchal - Computing and Informatics, 2018 - cai.sk
The aim of the vertex clique covering problem (CCP) is to cover the vertices of a graph with
as few cliques as possible. We analyse the iterated greedy (IG) algorithm for CCP, which …