Dardel F
Laboratoire de Biochimie, UA 240 du Centre National de la Recherche Scientifique, Ecole Polytechnique, Palaiseau, France.
Comput Appl Biosci. 1985 Sep;1(3):173-5. doi: 10.1093/bioinformatics/1.3.173.
During the course of determining the sequence of a large DNA fragment, it is necessary to cross-check numerous gel readings from different DNA fragments, in order to track and eliminate mistakes. An algorithm is presented that takes advantage of the high degree of homology between such sequences to construct an alignment of the matching regions. It does not require knowledge of a starting homology zone, neither large memory areas, even for sequences of several kilobases, and it can overcome large gaps or mismatch zones that correspond for instance to misinterpretation of compressions on sequence gels. This algorithm has been implemented in 6502 assembly language on an Apple II computer as an extension to the PEGASE sequence handling system.