Quasifibrations of graphs to find symmetries and reconstruct biological networks

DOI10.1088/1742-5468/ac99d1OpenAlexW4308586196MaRDI QIDQ5055404

Paolo Boldi, Ian Leifer, Hernán Makse

Publication date: 13 December 2022

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.06999

zbMATH Keywords

bioinformaticscomputational biologysystems biologyinformation processing

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Uses Software

• Silhouettes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on tree edit distance and related problems
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Partitioning a graph in \(O(|A|\log_ 2|V|)\)
• Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
• The partition problem
• Tight lower and upper bounds for the complexity of canonical colour refinement
• A new status index derived from sociometric analysis
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Three Partition Refinement Algorithms
• Modern Algorithms of Cluster Analysis
• Axioms for Centrality
• Symmetry-driven network reconstruction through pseudobalanced coloring optimization
• Nonlinear dynamics of networks: the groupoid formalism
• Fibrations of graphs