Use various graph algorithms to analyze gene networks and
protein-protein interactions. Represent different types of graphs using
sparse matrices. Visualize graphs and network relationships using the
biograph object which lets you calculate the
position of nodes, draw the graph, and find relations between nodes.
|(To be removed) Find all shortest paths in graph|
|(To be removed) Find strongly or weakly connected components in graph|
|(To be removed) Test for cycles in directed graph|
|(To be removed) Find isomorphism between two graphs|
|(To be removed) Determine if tree is spanning tree|
|(To be removed) Calculate maximum flow in directed graph|
|(To be removed) Find minimal spanning tree in graph|
|(To be removed) Convert predecessor indices to paths|
|(To be removed) Solve shortest path problem in graph|
|(To be removed) Perform topological sort of directed acyclic graph|
|(To be removed) Traverse graph by following adjacent nodes|
Graph theory functions in the Bioinformatics Toolbox™ apply basic graph theory algorithms to sparse matrices.
The Bioinformatics Toolbox includes functions, objects, and methods for creating, viewing, and manipulating graphs such as interactive maps, hierarchy plots, and pathways.