Dot plot (bioinformatics)
From Wikipedia, the free encyclopedia
A dot plot plot is a graphical method that allows the comparison of two biological sequences and identify regions of close similarity between them. It is a kind of recurrence plot.
The simplest way to visualize the similarity between two protein sequences is to use a similarity matrix, known as a dot plot, These were introduced by Philips in the 1970s and are two-dimensional matrices which have the sequences of the proteins being compared along the vertical and horizontal axes, For a simple visual representation of the similarity between two sequences, individual cells in the matrix can be shaded black if residues are identical, so that matching sequence segments appear as runs of diagonal lines across the matrix
Some idea of the similarity of the two sequences can be gleaned from the number and length of matching segments shown in the matrix. Identical proteins will obviously have a diagonal line in the center of the matrix. Insertions and deletions between sequences give rise to disruptions in this diagonal. Regions of local similarity or repetitive sequences give rise to further diagonal matches in addition to the central diagonal. Because of the limited protein alphabet, many matching sequence segments may simply have arisen by chance. One way of reducing this noise is to only shade runs or 'tuples' of residues, e.g. a tuple of 3 corresponds to three residues in a row. This is effective because the probability of matching three residues in a row by chance is much lower than singleresidue matches. It can be seen from Figures 3.3h,c that the number of diagonal runs in the matrix has been considerably reduced by looking for 2-tuples or 3-tuples.
Example of a dot plot for comparing two simple protein sequences. (a) All cells associated with identical residue pairs between the sequences are shaded black; (b) only those cells associated with identical tuples of two residues are shaded black; (c) only cells associated with tuples of three are shaded and the optimal path through the matrix has been drawn. This is constrained to be within the window given by the two black lines parallel to the central diagonal. An alternative high-scoring path is also shown.