Discovering Pairwise Compatibility Graphs

@article{Yanhaona2010DiscoveringPC,
  title={Discovering Pairwise Compatibility Graphs},
  author={Muhammad Nur Yanhaona and Md. Shamsuzzoha Bayzid and Md. Saidur Rahman},
  journal={Discrete Math., Alg. and Appl.},
  year={2010},
  volume={2},
  pages={607-624}
}
Let T be an edge weighted tree, let dT (u, v) be the sum of the weights of the edges on the path from u to v in T , and let dmin and dmax be two non-negative real numbers such that dmin ≤ dmax. Then a pairwise compatibility graph of T for dmin and dmax is a graph G = (V, E), where each vertex u′ ∈ V corresponds to a leaf u of T and there is an edge (u′, v′) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax. A graph G is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Discovering Pairwise compatibility graphs

  • M. N. Yanhaona, M. S. Bayzid, M. S. Rahman
  • Proc. 16th International Computing and…
  • 2010
1 Excerpt

Uniform sampling from phylogenetic trees

  • D. Phillips
  • Master’s thesis, University of Waterloo, August
  • 2002
1 Excerpt

R

  • T. H. Cormen, C. E. Leiserson
  • L. Rivest and C. Stein, Introduction to…
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…