Book contents
- Computational Thinking for Life Scientists
- Reviews
- Computational Thinking for Life Scientists
- Copyright page
- Dedication
- Contents
- Introduction
- Part I: Programming in Python
- Part II: Sequences
- Part III: Graphs and Networks
- 5 Basic Notions in Graph Theory
- 6 Shortest Paths and Breadth First Search
- 7 Simulation of Regulatory Networks
- Part IV: Images
- Part V: Limitations of Computing
- Index
- References
5 - Basic Notions in Graph Theory
from Part III: - Graphs and Networks
Published online by Cambridge University Press: 19 August 2022
- Computational Thinking for Life Scientists
- Reviews
- Computational Thinking for Life Scientists
- Copyright page
- Dedication
- Contents
- Introduction
- Part I: Programming in Python
- Part II: Sequences
- Part III: Graphs and Networks
- 5 Basic Notions in Graph Theory
- 6 Shortest Paths and Breadth First Search
- 7 Simulation of Regulatory Networks
- Part IV: Images
- Part V: Limitations of Computing
- Index
- References
Summary
This chapter begins with a definition of what a graph is. While the definition is rather abstract, it is general enough to make graph theory relevant and applicable to a wide range of systems, in a variety of contexts. We will also see how to represent graphs in Python (or any other programming language). Such a representation allows a computerized inspection of many graph properties, as well as implementing various algorithms on graphs. By the end of this chapter, you will be familiar with many basic notions in this field. The last two sections of this chapter introduce the notions of clusters and clustering, and of hierarchical clustering in the context of phylogenetic trees. We note that the treatment of these two topics here hardly touches their surface – both are deep subjects in their own right, covered by vast and diverse literature.
- Type
- Chapter
- Information
- Computational Thinking for Life Scientists , pp. 93 - 112Publisher: Cambridge University PressPrint publication year: 2022