A fast word search algorithm for the representation of sequence similarity in genomic DNA.
Representation of sequence similarity by dot matrix plots is a method widely used for comparing biological sequences. The user is presented with an overall view of similarity between two sequences. Computation of this plot has been reconsidered here. An improvement is proposed through the preprocessing of the data into an automation recognizing the word structure of a sequence. The main advantage of this approach is to systematically eliminate the repetitions during word comparison. Simple heuristics are also considered to greatly speed up pattern matching. As a result, large sequences are handled very efficiently. This is illustrated by a comparison of large genomic DNA. The algorithm has been implemented in an interactive application on a microcomputer.
Lefèvre
C
C
Genosphere Project, ERATO, JRDC, Tokai University School of Medicine, Kanagawa, Japan.
Ikeda
J E
JE
D000465:Algorithms; D003196:Computer Graphics; D004271:DNA, Fungal / Q000235:genetics; D012091:Repetitive Sequences, Nucleic Acid; D012441:Saccharomyces cerevisiae / Q000235:genetics*; D012689:Sequence Homology, Nucleic Acid; D012984:Software
D004271:DNA, Fungal