Search bioRxiv⌕ Search
Home/Archive/bioRxiv

bioRxiv · 10.1101/2020.03.02.973263

Visibility Graph Based Community Detection for Biological Time Series

Zheng, M.·Domanskyi, S.·Piermarocchi, C.·Mias, G. I.
View original source ↗Export metadata ↓

Abstract

MotivationTemporal behavior is an essential aspect of all biological systems. Time series have been previously represented as networks. Such representations must address two fundamental problems: (i) How to create the appropriate network to reflect the characteristics of biological time series. (ii) How to detect characteristic temporal patterns or events as network communities. General methods to detect communities have used metrics to compare the connectivity within a community to the connectivity one would expect in a random model, or assumed a known number of communities, or are based on the betweenness centrality of edges or nodes. However, such methods were not specifically designed for network representations of time series. We introduce a visibility-graph-based method to build networks from different kinds of biological time series and detect temporal communities within these networks. ResultsTo characterize the uneven sampling of typical experimentally obtained biological time series, and simultaneously capture events associated to peaks and troughs, we introduce the Weighted Dual-Perspective Visibility Graph (WDPVG) for time series. To detect communities, we first find the shortest path of the network between start and end nodes to identify nodes which have high intensities. This identifies the main stem of our community detection algorithm. Then, we aggregate nodes outside the shortest path to the nodes found on the main stem based on the closest path length. Through simulation, we demonstrate the validity of our method in detecting community structures on various networks derived from simulated time series. We also confirm its effectiveness in revealing temporal communities in experimental biological time series. Our results suggest our method of visibility graph based community detection can be effective in detecting temporal biological patterns. AvailabilityThe methods of building WDPVG and visibility graph based community detection are available as a module of the open source Python package PyIOmica (https://doi.org/10.5281/zenodo.3691912) with documentation at https://pyiomica.readthedocs.io/en/latest/. The dataset and codes we used in this manuscript are publicly available at https://doi.org/10.5281/zenodo.3693984. Contactgmias@msu.edu

Source connections

Explore related subjects

bioinformaticsPreprint

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zheng, M., Domanskyi, S., Piermarocchi, C., Mias, G. I.. 2020-03-03. Visibility Graph Based Community Detection for Biological Time Series. https://doi.org/10.1101/2020.03.02.973263

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related preprints

bioRxiv2026

RoDPAA: A Robust Dissimilarity-Based Principal Angle Analysis Framework for Multi-View Microbiome Data Integration

Multiview microbiome studies profile the same participants across body sites or molecular layers, but integration is hampered by sparse, compositional data, modest sample sizes and methods that recognize only exact sharing. We present RoDPAA (Robust Dissimilarity-based Principal Angle Analysis), a framework that represents each view through any data-appropriate dissimilarity, such as Bray--Curtis, without log-ratio transformation or likelihood assumptions. RoDPAA aligns view-specific signal subspaces through principal angles, captures complete and partial sharing, and tests by permutation how many components are shared, using only eigendecomposition and little tuning. In Gaussian simulations, RoDPAA matched JIVE and MOFA given true ranks, ran faster and alone recovered the shared dimension in every replicate. In two inflammatory bowel disease (IBD) cohorts with sparse, zero-inflated data, Bray--Curtis-based RoDPAA recovered shared structure that was stable to prevalence filtering, whereas log-ratio-based alternatives were not. Its leading microbiome--metabolome factors, learned without disease labels, were the only ones associated with IBD.

bioinformatics↗
bioRxiv2026

Deducing splicing events from transcript sets with splicelogic

Long-read RNA sequencing captures a greater proportion of full-length transcripts, enabling more accurate isoform identification, discovery of novel isoforms, and more precise differential transcript usage analysis. However, comparing transcripts, whether between conditions or between sets such as novel and annotated isoforms, yields complex isoform changes that are hard to manipulate, summarize, and visualize. This is compounded by vertical integration of some tools, where downstream analysis depends on the specific output of a particular upstream tool. To address this gap, we have developed splicelogic, an R/Bioconductor package that makes transcript-set comparisons biologically interpretable by turning them into discrete splicing events, such as exon skipping, alternative splice sites, intron retention, and alternative transcription start and end sites. We designed splicelogic to integrate easily with existing RNA-seq workflows and tools. The splicelogic functions are modular, readable, and extensible, making it easy for users to adapt core logic to their own custom scientific questions or novel splicing definitions. By obtaining interpretable splicing events from transcript changes, splicelogic enables downstream analyses, including annotation of RNA-binding protein recognition sites, alongside summary statistics and visualization. The splicelogic package is publicly available and distributed through Bioconductor.

bioinformatics↗
bioRxiv2026

Contrastive Learning Improves Generalization on M2OR Olfactory Binding Dataset

Olfaction-based biosensors stand to have profound impacts in fields such as medical diagnostics, national security, and drug discovery. A promising mode of vapor phase biodetection mimics volatile organic compound-olfactory receptor (VOC-OR) interactions with target-specific protein or peptide probes; however, lack of experimental coverage remains a core bottleneck. Current computational approaches aim to improve prediction of VOC-OR binding to reduce experimental burden, and current machine learning approaches fail to demonstrate a level of generalization that addresses current engineering challenges. Here, using the Molecular to Olfactory Dataset (M2OR) and Insect Olfactory Binding Protein Database (iOBPdb) datasets, data partitioning methods and their performance are evaluated on a neural network and contrastive learning framework on such VOC-OR binding datasets, varying: model training, architecture, and structure of the input data distribution. It was found that holding out certain chemical or proteomic motifs from the training data diminished model performance with a two layer neural network model. The model was able to generalize to state of the art performance (0.88 AUCROC) on every data split by applying a contrastive learning objective defined by shared molecular constituents and a stochastic sampler. This suggests the contrastive objective provides a strong inductive bias for neural networks to predict novel VOC-OR pairs. These findings highlight that model performance on pairwise biological interaction datasets can be inflated through identity leakage from constituent overlap, and emphasize the need for more robust evaluation protocols. Furthermore, we show contrastive regularization mitigates dataset degeneracy through enforcement of compatibility in the models latent geometry that may extend to other binder target-datasets where identity leakage confounds evaluation.

bioinformatics↗