Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Hu, Jingtiana; b | Ferguson, Andrew L.a; c; *
Affiliations: [a] Department of Materials Science and Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, USA | [b] Department of Materials Science and Engineering, Northwestern University, Evanston, IL, USA | [c] Department of Chemical and Biomolecular Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, USA
Correspondence: [*] Corresponding author: Andrew L. Ferguson, Department of Materials Science and Engineering, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA. Tel.: +86 217 300 2354; Fax: +86 217 333 2736; E-mail:alf@illinois.edu
Abstract: We present a new algorithm, global positioning graph matching (GPGM), to perform global network alignments between pairs of undirected graphs by minimizing a dissimilarity score over matched vertices. We define structural dissimilarities based on a random walk over each graph to provide a robust measure of the global graph topology using a nonlinear manifold learning algorithm known as diffusion maps. Measures of vertex-vertex dissimilarity are straightforwardly incorporated in a convex combination. We have tested our approach in pairwise alignments of protein-protein interaction networks of Xenopus laevis (frog), Rattus norvegicus (rat), Caenorhabditis elegans (worm), Mus musculus (mouse), and Drosophila melanogaster (fly). When vertex-vertex dissimilarities are incorporated using homology scores between protein sequences, the performance of GPGM is comparable to that of the IsoRank algorithm (Singh et al. Proc. Natl. Acad. Sci. USA 105 35 12763 (2008)). When homology information is not included, GPGM discovers superior alignments, making it well suited to graph matching applications where vertex labels are unknown or undefined.
Keywords: Graph matching, diffusion maps, protein-protein interaction (PPI) networks
DOI: 10.3233/IDA-160824
Journal: Intelligent Data Analysis, vol. 20, no. 3, pp. 637-654, 2016
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl