Graph Theory for Bioinformatics Wright State University生物信息学的图论莱特州立大学.pptVIP

Graph Theoretic Concepts and Algorithmsfor Bioinformatics What is a “graph” Formally: A finite graph G(V, E) is a pair (V, E), where V is a finite set and E is a binary relation on V. Recall: A relation R between two sets X and Y is a subset of X x Y. For each selection of two distinct V’s, that pair of V’s is either in set E or not in set E. The elements of the set V are called vertices (or nodes) and those of set E are called edges. Undirected graph: The edges are unordered pairs of V (i.e. the binary relation is symmetric). Ex: undirected G(V,E); V = {a,b,c}, E = {{a,b}, {b,c}} Directed