Lagrangian relaxations for multiple network alignment
Authors:
- 30 March 2017
- journal article
- research article
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 31 (5) , 1331-1358
Abstract
No abstract availableKeywords
Funding Information
- Suomen Akatemia (FI) (286211)
This publication has 23 references indexed in Scilit:
- NetCoffee: a fast and accurate global alignment approach to identify functionally conserved proteins in multiple networksBioinformatics, 2013
- SMETANA: Accurate and Scalable Algorithm for Probabilistic Alignment of Large-Scale Biological NetworksPLOS ONE, 2013
- Message-Passing Algorithms for Sparse Network AlignmentACM Transactions on Knowledge Discovery From Data, 2013
- IsoRankN: spectral methods for global alignment of multiple protein networksBioinformatics, 2009
- A new graph-based method for pairwise global network alignmentBMC Bioinformatics, 2009
- Global alignment of multiple protein interaction networks with application to functional orthology detectionProceedings of the National Academy of Sciences, 2008
- A Lagrangian relaxation approach for the multiple sequence alignment problemJournal of Combinatorial Optimization, 2008
- Collective entity resolution in relational dataACM Transactions on Knowledge Discovery From Data, 2007
- Heuristics for the fixed cost median problemMathematical Programming, 1982
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981