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
- 3 Sets, Dictionaries, and Hashing
- 4 Biological Patterns and Regular Expressions
- Part III: Graphs and Networks
- Part IV: Images
- Part V: Limitations of Computing
- Index
4 - Biological Patterns and Regular Expressions
from Part II: - Sequences
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
- 3 Sets, Dictionaries, and Hashing
- 4 Biological Patterns and Regular Expressions
- Part III: Graphs and Networks
- Part IV: Images
- Part V: Limitations of Computing
- Index
Summary
In this chapter, we study another common string-related problem – pattern matching. Suppose we want to find a given sequence motif, or pattern, in a genome or protein, where the pattern is not unique. In other words, the pattern has more than a single possible matching sequence. To that end, we will introduce the fundamental notion of regular expressions, and their use to solve this problem. In addition, we will discuss the closely related notion of finite state machines (FSM), another basic concept in computer science.
- Type
- Chapter
- Information
- Computational Thinking for Life Scientists , pp. 79 - 90Publisher: Cambridge University PressPrint publication year: 2022