This function plots the dynamic programming table, the (back)pointers
and the combined graph of optimal edit transcripts (alignments) computed
with sdist.trace
. The fist sequence is represented by the y-axis
and the second by the x-axis.
The circumference of a circle is proportional to the minimum cost
(maximum weight) of edit (alignment) operations leading to a table cell.
circle.scale
specifies the type of normalization performed where
last
means the last table entry (containing the optimum value),
and text
draws the values instead of circles.
The (back)pointers, defining possible (traceback) paths, are plotted
as dotted
edges. Note that a traceback starts in the last cell
of the table and ends at the origin.
For the edges of the graph that is the union of all optimal paths, two
line types are used: solid
for insert, delete, and replace
operations, and dashed
for a match. The line width indicates the
number of times an edge is on a path, but note that the interpretation
is device-specific (compare par
).