page 31:

WAS: For now we show in Figure 2.1(a) a circular restriction map of a famous plasmid in (pBR322,4363 bps) in E. coli...

IS: For now we show in Figure 2.1(a) a circular restriction map of a famous plasmid (pBR322, 4363 bps) in E. coli...

Correction by Steven Salzberg, 10/5/95


page 37:

AFTER: Algorithm 2.1 (Restriction Map)

APPEND: Algorithm 2.1 takes a restriction map in the form of an interval graph and produces a linear ordering of the restriction fragments, if one exists.

Correction by Steven Salzberg, 10/5/95.


WAS:

     1. find an end.
        . . . if no such u exists . . .

IS:

     1. find an end.
        . . . if no such v exists . . .
Correction by J. User


WAS:

     . . . between {vi, v} and in the component edge list.

IS:

     . . . between {vi, v} and {v, vi+2} in the component edge list.
Correction by Leonid Peshkin, 18 February 1997.


Previous Level

USC Computational Biology Home Page


http://www-hto.usc.edu/books/msw/msg/corrections/Chapter2/index.html, webmaster@hto.usc.edu, 8 September 1997