Madan Sathe
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Madan Sathe has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Ahmed Sameh
Purdue University
1 shared publication - Ananth Grama
Purdue University, West Lafayette, IN, USA
1 shared publication - Giorgos Kollias
Center for Science of Information, West Lafayette, IN 47907, USA
1 shared publication - Matthias Christen
University of Basel
1 shared publication - Murat Manguoglu
Department of Computer Science, Purdue University - West Lafayette, 305 N. University Street, West Lafayette, IN, 47907-2107, United States
1 shared publication - Olaf Schenk
Università Della Svizzera italiana, Lugano, Switzerland
1 shared publication
Latest Publications
- Open Access
- 31 January 2013
- Published by Springer Nature in BMC Research Notes
- Vol. 6 (1) , 35
A fast approach to global alignment of protein-protein interaction networks
Global network alignment has been proposed as an effective tool for computing functional orthology. Commonly used global alignment techniques such as IsoRank rely on a two-step process: the first step is an iterative diffusion-based approach for assigning similarity scores to all possible node pairs (matchings); the second step applies a maximum-weight bipartite matching algorithm to this similarity score matrix to identify orthologous node pairs. While demonstrably successful in identifying orthologies beyond those based on sequences, this two-step process is computationally expensive. Recent work on computation of node-pair similarity matrices has demonstrated that the computational cost of the first step can be significantly reduced. The use of these accelerated methods renders the bipartite matching step as the dominant computational cost. This motivates a critical assessment of the tradeoffs of computational cost and solution quality (matching quality, topological matches, and biological significance) associated with the bipartite matching step. In this paper we utilize the state-of-the-art core diffusion-based step in IsoRank for similarity matrix computation, and couple it with two heuristic bipartite matching algorithms – a matrix-based greedy approach, and a tunable, adaptive, auction-based matching algorithm developed by us. We then compare our implementations against the performance and quality characteristics of the solution produced by the reference IsoRank binary, which also implements an optimal matching algorithm.
- 31 January 2013
- Published by Springer Nature in BMC Research Notes
- Vol. 6 (1) , 35
Open AccessA fast approach to global alignment of protein-protein interaction networks
Global network alignment has been proposed as an effective tool for computing functional orthology. Commonly used global alignment techniques such as IsoRank rely on a two-step process: the first step is an iterative diffusion-based approach for assigning similarity scores to all possible node pairs (matchings); the second step applies a maximum-weight bipartite matching algorithm to this similarity score matrix to identify orthologous node pairs. While demonstrably successful in identifying orthologies beyond those based on sequences, this two-step process is computationally expensive. Recent work on computation of node-pair similarity matrices has demonstrated that the computational cost of the first step can be significantly reduced. The use of these accelerated methods renders the bipartite matching step as the dominant computational cost. This motivates a critical assessment of the tradeoffs of computational cost and solution quality (matching quality, topological matches, and biological significance) associated with the bipartite matching step. In this paper we utilize the state-of-the-art core diffusion-based step in IsoRank for similarity matrix computation, and couple it with two heuristic bipartite matching algorithms – a matrix-based greedy approach, and a tunable, adaptive, auction-based matching algorithm developed by us. We then compare our implementations against the performance and quality characteristics of the solution produced by the reference IsoRank binary, which also implements an optimal matching algorithm.
- 6 May 2009
- Published by Springer Nature in Computer Science - Research and Development
- Vol. 23 (3-4) , 177-183
Parallel scalable PDE-constrained optimization: antenna identification in hyperthermia cancer treatment planning
- 6 May 2009
- Published by Springer Nature in Computer Science - Research and Development
- Vol. 23 (3-4) , 177-183
Parallel scalable PDE-constrained optimization: antenna identification in hyperthermia cancer treatment planning