Chapter 13. Complexity of Phylogenetic Networks: Counting Cubes in Median Graphs and Related Problems
- PD Dr. habil. Matthias Dehmer3,4,
- Prof. Dr. Frank Emmert-Streib5
Published Online: 21 AUG 2009
DOI: 10.1002/9783527627981.ch13
Copyright © 2009 Wiley-VCH Verlag GmbH & Co. KGaA
Book Title
Analysis of Complex Networks: From Biology to Linguistics
Additional Information
How to Cite
Kovše, M. (2009) Complexity of Phylogenetic Networks: Counting Cubes in Median Graphs and Related Problems, in Analysis of Complex Networks: From Biology to Linguistics (eds M. Dehmer and F. Emmert-Streib), Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim, Germany. doi: 10.1002/9783527627981.ch13
Editor Information
- 3
Vienna University of Technology, Discrete Mathematics and Geometry, Wiedner Hauptstraße 8–10, 1040 Vienna, Austria
- 4
University of Coimbra, Center for Mathematics, Apartado 3008, 3001-454 Coimbra, Portugal
- 5
Computational Biology and Machine Learning, Center for Cancer Research and Cell Biology, School of Medicine, Dentistry and Biomedical Sciences, Queen's University Belfast, 97 Lisburn Road, Belfast, BT9 7BL, UK
Publication History
- Published Online: 21 AUG 2009
- Published Print: 22 APR 2009
ISBN Information
Print ISBN: 9783527323456
Online ISBN: 9783527627981
- Summary
- Chapter
- References
Keywords:
- cube polynomial;
- median graph;
- Cartesian product
Summary
We survey various results on counting hypercubes and related problems. Since median graphs are built in a very special way from hypercubes, the number of hypercubes of different dimensions can also be considered as a measure of complexity for this class of graphs. Applications to phylogenetics are also mentioned.
We conclude with some possible directions for further investigations.