Learn More
Analogous to genomic sequence alignment, biological network alignment identifies conserved regions between networks of different species. Then, function can be transferred from well- to poorly-annotated species between aligned network regions. Network alignment typically encompasses two algorithmic components: node cost function (NCF), which measures(More)
Network alignment can be used to transfer functional knowledge between conserved regions of different networks. Typically, existing methods use a node cost function (NCF) to compute similarity between nodes in different networks and an alignment strategy (AS) to find high-scoring alignments with respect to the total NCF over all aligned nodes (or node(More)
Biological network alignment aims to find regions of topological and functional (dis)similarities between molecular networks of different species. Then, network alignment can guide the transfer of biological knowledge from well-studied model species to less well-studied species between conserved (aligned) network regions, thus complementing valuable(More)
Prairie cordgrass (Spartina pectinata Link) is a polyploid Chloridoid grass with tetraploid (2n = 40), hexaploid (2n = 60), and octoploid (2n = 80) cytotypes and is a potential dedicated energy crop with promising yields in marginal environments. Efforts to breed prairie cordgrass are currently hampered by the lack of a linkage map, the lack of a Chloridoid(More)
Analogous to genomic sequence alignment, biological network alignment (NA) aims to find regions of similarities between molecular networks (rather than sequences) of different species. NA can be either local (LNA) or global (GNA). LNA aims to identify highly conserved common subnetworks, which are typically small, while GNA aims to identify large common(More)
Modeling of metabolic pathways in biology and process management in operating systems are applications of mixed graphs. A mixed graph is a graph with directed edges, called arcs, and undirected edges. The weak (resp. strong) chromatic polynomial of a mixed graph is a counting function that counts proper k-colorings, that is, assigning colors to vertices(More)
  • 1