Global and Local Alignments
Global alignments, which attempt to align every residue in every sequence, are most useful when the sequences in the query set are similar and of roughly equal size. (This does not mean global alignments cannot end in gaps.) A general global alignment technique is the Needleman–Wunsch algorithm, which is based on dynamic programming. Local alignments are more useful for dissimilar sequences that are suspected to contain regions of similarity or similar sequence motifs within their larger sequence context. The Smith–Waterman algorithm is a general local alignment method also based on dynamic programming. With sufficiently similar sequences, there is no difference between local and global alignments.
Hybrid methods, known as semiglobal or "glocal" (short for global-local) methods, attempt to find the best possible alignment that includes the start and end of one or the other sequence. This can be especially useful when the downstream part of one sequence overlaps with the upstream part of the other sequence. In this case, neither global nor local alignment is entirely appropriate: a global alignment would attempt to force the alignment to extend beyond the region of overlap, while a local alignment might not fully cover the region of overlap.
Read more about this topic: Sequence Alignment
Famous quotes containing the words global and/or local:
“As the global expansion of Indian and Chinese restaurants suggests, xenophobia is directed against foreign people, not foreign cultural imports.”
—Eric J. Hobsbawm (b. 1917)
“This is the only “wet” community in a wide area, and is the rendezvous of cow hands seeking to break the monotony of chuck wagon food and range life. Friday night is the “big time” for local cowboys, and consequently the calaboose is called the “Friday night jail.””
—Administration in the State of Texa, U.S. public relief program (1935-1943)