SANA: Simulated Annealing Network Alignment Applied to Biological Networks
Nil Mamano, Wayne Hayes

TL;DR
This paper introduces SANA, a stochastic simulated annealing algorithm for biological network alignment, demonstrating superior optimization performance over existing methods across various objective functions.
Contribution
The paper presents SANA, a novel stochastic search algorithm for network alignment, improving optimization quality across multiple objective functions in biological networks.
Findings
SANA outperforms existing algorithms in optimizing objective functions.
SANA effectively explores the space of possible alignments.
The software is publicly available for use and further research.
Abstract
The alignment of biological networks has the potential to teach us as much about biology and disease as has sequence alignment. Sequence alignment can be optimally solved in polynomial time. In contrast, network alignment is -hard, meaning optimal solutions are impossible to find, and the quality of found alignments depend strongly upon the algorithm used to create them. Every network alignment algorithm consists of two orthogonal components: first, an objective function or measure that is used to evaluate the quality of any proposed alignment, and second, a search algorithm used to explore the exponentially large set of possible alignments in an effort to find "good" ones according to . Objective functions fall into many categories, including biological measures such as sequence similarity, as well as topological measures like graphlet similarity and edge coverage (possibly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBioinformatics and Genomic Networks · Gene Regulatory Network Analysis · Gene expression and cancer classification
