A heuristic algorithm to align protein interaction networks
From MaRDI portal
Recommendations
- Research in Computational Molecular Biology
- Protein mover's distance: a geometric framework for solving global alignment of PPI networks
- \textit{Pin-Align}: a new dynamic programming approach to align protein-protein interaction networks
- Heuristic algorithms in computational molecular biology
- Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
Cited in
(11)- Protein mover's distance: a geometric framework for solving global alignment of PPI networks
- Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
- \textit{Pin-Align}: a new dynamic programming approach to align protein-protein interaction networks
- A parallel method for querying target subnetwork in a biomolecular network
- Chapman-Kolmogorov equations for global PPIs with discriminant-EM
- PBNA: an improved probabilistic biological network alignment method
- Quasi-bicliques: Complexity and Binding Pairs
- Scalable algorithms for multiple network alignment
- Research in Computational Molecular Biology
- Exact \(p\)-values for global network alignments via combinatorial analysis of shared GO terms. \textit{REFANGO}: \textit{R}igorous \textit{E}valuation of \textit{F}unctional \textit{A}lignments of \textit{N}etworks using \textit{G}ene \textit{O}ntology
- Heuristic algorithms in computational molecular biology
This page was built for publication: A heuristic algorithm to align protein interaction networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2887254)
