Phillipe Dessen, Christian Fondrat, Claire Valencien, Claude Mugnier; BISANCE: A French service for access to biomolecular sequence databases, Bioinformati

We have developed a new algorithm 'Complete 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 'sentences 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.

A computer program has been written in FORTRAN 77 to locate on a protein sequence a region with optimum length and limited degeneracy in order to design artificial oligonucleotide probes for use in molecular cloning. In addition the program checks for regions of homology between this probe and any other base sequence found in nucleotide sequence data banks. There are options in the program to eliminate rare codons or to make preferential choices of bases in order to minimize the degeneracy of probes.