[A rapid method of searching for homology of nucleic acid sequences].

A new method of the homology search between DNA sequences was suggested. This method may be used to find extensive and not strong homologies with point mutations and deletions. The computer time to compare sequences is less than dynamic program algorithms at least by four orders of magnitude. It makes possible to use the method for homology search all over the nucleotide bank by personal computers. Some results of homology search are presented.