As a consequence, best matches in a pair of species in general form a many-to-many relationship and are not necessarily symmetric. Given (T,σ), the digraph G→(T,σ)=(V,E) with vertex set V=L(T), vertex-coloring σ, and with arcs (x,y)∈E if and only if y is a best match of x w.r.t. (T,σ) is called the best match graph (BMG) of (T,σ) [6], see Fig. 2 for an illustrative example.
展开▼
