This paper presents a method for the multiple alignment of a sequence set. The MASH algorithm uses a non-redundant database of common motifs and an 'alignment priority' criterion that depends on the length and the occurrence frequency of the patterns in the set of sequences. This user-defined criterion allows the determination of the series of the patterns to be aligned. This program is applied to a fragment of envelope gene env gp120 for 20 isolates of the immunodeficiency virus. The multiplicity of alignments obtained by modifying the criterion parameters reveals different aspects of similarity between the sequences.

We propose a new method, called 'size leap' algorithm, of search for motifs of maximum size and common to two fragments at least. It allows the creation of a reduced database of motifs from a set of sequences whose size obeys the series of Fibonacci numbers. The convenience lies in the efficiency of the motif extraction. It can be applied in the establishment of overlap regions for DNA sequence reconstruction and multiple alignment of biological sequences. The method of complete DNA sequence reconstruction by extraction of the longest motifs ('anchor motifs') is presented as an application of the size leap algorithm. The details of a reconstruction from three sequenced fragments are given as an example.

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.