‘Size leap’ algorithm: an efficient extraction of the longest common motifs from a molecular sequence set. Application to the DNA sequence reconstruction

Lien vers Pubmed [PMID] – 1747784

Comput. Appl. Biosci. 1991 Oct;7(4):509-13

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.