About: GRAph ALigner (GRAAL)

An Entity of Type: Network108434259, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

GRAaph ALigner (GRAAL) is an algorithm for global network alignment that is based solely on network topology. It aligns two networks and by producing an alignment that consists of a set of ordered pairs , where is a node in and is a node in . GRAAL matches pairs of nodes originating in different networks based on their graphlet degree signature similarities, where a higher similarity between two nodes corresponds to a higher topological similarity between their extended neighborhoods (out to distance 4). GRAAL produces global alignments, i.e., it aligns each node in the smaller network to exactly one node in the larger network. The matching proceeds using a technique analogous to the "seed and extend" approach of the popular BLAST algorithm for sequence alignment: it first chooses a s

Property Value
dbo:abstract
  • GRAaph ALigner (GRAAL) is an algorithm for global network alignment that is based solely on network topology. It aligns two networks and by producing an alignment that consists of a set of ordered pairs , where is a node in and is a node in . GRAAL matches pairs of nodes originating in different networks based on their graphlet degree signature similarities, where a higher similarity between two nodes corresponds to a higher topological similarity between their extended neighborhoods (out to distance 4). GRAAL produces global alignments, i.e., it aligns each node in the smaller network to exactly one node in the larger network. The matching proceeds using a technique analogous to the "seed and extend" approach of the popular BLAST algorithm for sequence alignment: it first chooses a single "seed" pair of nodes (one node from each network) with high graphlet degree signature similarity. It then expands the alignment radially outward around the seed as far as practical using a greedy algorithm (see [Kuchaiev et al., 2010] for details). (en)
dbo:wikiPageID
  • 26424126 (xsd:integer)
dbo:wikiPageLength
  • 5899 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1069505388 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • GRAaph ALigner (GRAAL) is an algorithm for global network alignment that is based solely on network topology. It aligns two networks and by producing an alignment that consists of a set of ordered pairs , where is a node in and is a node in . GRAAL matches pairs of nodes originating in different networks based on their graphlet degree signature similarities, where a higher similarity between two nodes corresponds to a higher topological similarity between their extended neighborhoods (out to distance 4). GRAAL produces global alignments, i.e., it aligns each node in the smaller network to exactly one node in the larger network. The matching proceeds using a technique analogous to the "seed and extend" approach of the popular BLAST algorithm for sequence alignment: it first chooses a s (en)
rdfs:label
  • GRAph ALigner (GRAAL) (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License