Sequence alignment is a way of arranging DNA, RNA or protein sequences to identify regions of similarity that may indicate functional, structural or evolutionary relationships between them. Aligned sequences are typically written as rows in a matrix, with gaps inserted so that identical or similar characters line up in the same columns; the degree of similarity at a given position indicates how conserved that region is across the sequences compared. Pairwise alignment compares two sequences at a time and is computationally efficient, making it well suited to database searches, while multiple sequence alignment incorporates three or more sequences at once, at greater computational cost, and is used to find conserved motifs, build phylogenetic trees and locate functionally important sites such as enzyme active sites. Both kinds of alignment are computed with a range of algorithmic strategies, from exact dynamic programming methods to faster heuristics, chosen according to sequence length and available computing resources. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Design Technique Connections
In Field
Source Wikipedia: Sequence alignment
Uses Design Technique
Sources
1. Wikipedia: Sequence alignment
entity record, description (design-technique)
Both kinds of alignment are computed with a range of algorithmic strategies, from exact dynamic programming methods to faster heuristics, chosen according to sequence length and available computing resources.
In Field: Bioinformatics, Lead sentence
sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity that may be a consequence of functional, structural, or evolutionary relationships between the sequences.
In Group: Edit Distance and Sequence Alignment Algorithms, Lead section
a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.