Natalie 2.0: sparse global network alignment as a special case of quadratic assignment

DOI10.3390/a8041035zbMath1461.90065OpenAlexW2173355656WikidataQ60142893 ScholiaQ60142893MaRDI QIDQ1736730

Jaap Heringa, Mohammed El-Kebir, Gunnar W. Klau

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a8041035

zbMATH Keywords

bioinformaticsnetwork analysisgraph matchingglobal network alignmentnetwork comparison

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (2)

Network alignment by discrete Ollivier-Ricci flow ⋮ Lagrangian relaxations for multiple network alignment

Uses Software

• SPINAL
• GHOST
• Natalie
• IsoRank
• KEGG
• STRING
• HubAlign
• NETAL
• MAGNA++
• NatalieQ
• L-GRAAL

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithm engineering for optimal alignment of protein structure distance matrices
• Lagrangean relaxation. (With comments and rejoinder).
• The Quadratic Assignment Problem
• Algorithms for the Assignment and Transportation Problems
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• A Heuristic Method for the Set Covering Problem
• Reducibility among Combinatorial Problems
• Paths, Trees, and Flowers
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: Natalie 2.0: sparse global network alignment as a special case of quadratic assignment