2008
DOI: 10.1007/978-3-540-78839-3_19
|View full text |Cite
|
Sign up to set email alerts
|

Automatic Parameter Learning for Multiple Network Alignment

Abstract: Abstract. We developed Graemlin 2.0, a new multiple network aligner with (1) a novel scoring function that can use arbitrary features of a multiple network alignment, such as protein deletions, protein duplications, protein mutations, and interaction losses; (2) a parameter learning algorithm that uses a training set of known network alignments to learn parameters for our scoring function and thereby adapt it to any set of networks; and (3) an algorithm that uses our scoring function to find approximate multip… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
73
0

Year Published

2008
2008
2016
2016

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 79 publications
(73 citation statements)
references
References 29 publications
0
73
0
Order By: Relevance
“…28 We do not compare our alignment to the one produced by Graemlin because Graemlin requires a variety of other input information, including phylogenetic relationships between the species being aligned. In contrast, GRAAL's output can be used to infer phylogenetic relationships.…”
Section: Comparison With Other Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…28 We do not compare our alignment to the one produced by Graemlin because Graemlin requires a variety of other input information, including phylogenetic relationships between the species being aligned. In contrast, GRAAL's output can be used to infer phylogenetic relationships.…”
Section: Comparison With Other Methodsmentioning
confidence: 99%
“…19,27,28 Unlike the above algorithms that primarily aim to detect conserved subnetworks, IsoRank 27 aims to maximize the overall match between the two networks. It relies on spectral graph theory to compute scores of aligning pairs of nodes from different networks; it does so by using the heuristic that two nodes are a good match if their respective neighbors also match well.…”
Section: Theoretical Backgroundmentioning
confidence: 99%
“…These include NetworkBLAST [Sharan et al 2005], MAWISH [Koyutürk et al 2006] NetAlign [Liang et al 2006], Graemlin [Flannick et al 2006[Flannick et al , 2008, IsoRank [Singh et al 2007[Singh et al , 2008, GRAAL [Kuchaiev et al 2010], Natalie [Klau 2009], Natalie 2.0 [El-Kebir et al 2011] and the algorithm of Bradde et al [2010]. Some of these tools have extensions for aligning more than two networks, but we focus on the two network case here.…”
Section: Finding Common Pathways In Biological Networkmentioning
confidence: 99%
“…This problem is motivated by applications in several areas including biology, computer vision, and natural language processing. For example, the study of protein interactions across different species has made network alignment a common topic in computational biology [Flannick et al 2006[Flannick et al , 2008Klau 2009;Kuchaiev et al 2009;Singh et al 2007Singh et al , 2008. In computer vision, network alignment is used for matching images [Conte et al 2004;Schellewald and Schnörr 2005], and in the ontology alignment, it is used for finding correspondence between different representations of a database [Lacoste-Julien et al 2006;Melnik et al 2002;Šváb 2007].…”
Section: Introductionmentioning
confidence: 99%
“…Analogous to sequence-based comparisons, network comparisons across species have also been used to identify proteins with similar functions and detect orthologs [1,6,7,8,9,10,11,12]. However, almost all of these network comparison methods rely mostly on sequence information and use only limited network topological information.…”
mentioning
confidence: 99%