Now showing items 11-14 of 14
The Genus of Complete Multipartite Graphs and Complete Multi- Layered Graphs
(ACS/IEEE International Conference on Computer Systems and Applications, 2010)
The complete multipartite graph and the complete multi-layered graph are both generalizations of the complete bipartite graph. These two kinds of graphs have recursive structure and offer a very flexible choice of network ...
Computing Gene Functional Similarity Using Combined Graphs
(Symposium on Applied Computing, 2012)
The Gene Ontology has been used extensively for measuring the functional similarity among genes of various organisms. All the existing gene similarity methods use either molecular function or biological process taxonomies ...
An Algorithm for Combining Graphs Based on Shared Knowledge
(International Conference on Bioinformatics and Computational Biology, 2012)
We propose an algorithm for connecting nodes from multiple disconnected graphs based on a given tuple set representing shared knowledge. The set of tuples is used to create bridgeedges for combining two graphs. The path ...
Ontology Based Semantic Siimilarity for Protein Interactions
(International Conference on Bioinformation and Computational Biology, 2013)
Ontology structure-based measures, like path length, have been used successfully for semantic similarity in various application domains. In bioinformatics, path length was used with the Gene Ontology (GO), using annotation ...