Pairwise alignment is often used to reveal similarities between sequences, determine the residue-residue correspondences, locate patterns of conservation, study gene regulation, and infer evolutionary relationships.
This chapter is divided into eight sections. It starts with a brief introduction in Section 3.1, followed by the dot matrix representation of pairwise sequence comparison in Section 3.2.
Using alignment graph, we derive a dynamic-programming method for aligning globally two sequences in Section 3.3. An example is used to illustrate the tabular computation for computing the optimal alignment score as well as the backtracking procedure for delivering an optimal global alignment.
Section 3.4 describes a method for delivering an optimal local alignment, which involves only a segment of each sequence. The recurrence for an optimal local alignment is quite similar to that for global alignment. To reflect the flexibility that an alignment can start at any position of the two sequences, an additional entry “zero” is added.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2009). Pairwise Sequence Alignment. In: Sequence Comparison. Computational Biology, vol 7. Springer, London. https://doi.org/10.1007/978-1-84800-320-0_3
Download citation
DOI: https://doi.org/10.1007/978-1-84800-320-0_3
Publisher Name: Springer, London
Print ISBN: 978-1-84800-319-4
Online ISBN: 978-1-84800-320-0
eBook Packages: Computer ScienceComputer Science (R0)