Restriction map construction using a 'complete sentences compatibility' algorithm
1988
We have developed a new algorithm C̀omplete sentences compatibility' (CSC) which uses single and double digestion fragments to rapidly determine restriction maps of circular DNA. From possible combinations of fragments of each simple digestion, which we call s̀entences of decomposition', we construct a restriction map which combines the sentences while taking into account compatibility rules. The algorithm can also deal with experimental errors of fragment weight and can suggest solutions that account for non-readable bands (fragments of zero length or multiple bands) on the gel. Because experiments using pairs of restrictive enzymes often result in multiple solutions, a complementary algorithm tries to reduce the number of proposed solutions by establishing consensus maps. The restriction map construction algorithm was tested on real cases, some containing more than fifteen fragments. Execution times range from 1-10 s on an IBM PC compatible microcomputer.
显示更多 [+] 显示较少 [-]