Article

Directed Shortest Walk on Temporal Graphs

2022-07-10

Abstract excerpt

<h4>Background</h4> The use of graphs as a way of abstracting and representing biological systems has provided a powerful analysis paradigm. Specifically, graph optimization algorithms are routinely used to address various connectivity queries, such as finding paths between proteins in a protein-protein interaction network, while maximizing objectives such as parsimony. While present studies in this field mostly...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work: 0b994cc4-c71b-54a5-b7c7-d19cc4c2f433
DOI: 10.1101/2022.07.08.499368

Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 9 closest

Directed Shortest Walk on Temporal GraphsDOI 10.1101/2022.07.08.499368Read

Connectivity Problems on Heterogeneous GraphsSemantic proximity Read

Unsupervised Inductive node representation learning for dynamic graphsSemantic proximity Read

Time is of the essence: A general framework for uncovering temporal structures of communitiesSemantic proximity Read

Identification of co-evolving temporal networksSemantic proximity Read

Reachability-Preserving Minimum Edge Cut Problem and Applications in BiologySemantic proximity Read

Generalized gene adjacencies, graph bandwidth, and clusters in yeast evolution.Semantic proximity Read

Time Evolving Undirected Graphical Model for Protein-Protein Interaction NetworksSemantic proximity Read

Embedding-aided network dismantlingSemantic proximity Read

Time-dependent structural transformation analysis to high-level Petri net model with active state transition diagram.Semantic proximity Read