Abstract
We’re already seen that alignments contain exact matches. So far we haven’t made use of this—even when comparing two identical sequences, we filled in the entire alignment matrix to find what amounts to one long exact match. It might be quicker to first look for exact matches and build alignments from them. As we shall see in Chapter 4, this is the approach used in modern alignment tools like Blast. This means that exact matching, the topic of this chapter, is eminently useful for inexact matching.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Haubold, B., Börsch-Haubold, A. (2023). Exact Matching. In: Bioinformatics for Evolutionary Biologists. Springer, Cham. https://doi.org/10.1007/978-3-031-20414-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-20414-2_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-20413-5
Online ISBN: 978-3-031-20414-2
eBook Packages: Biomedical and Life SciencesBiomedical and Life Sciences (R0)