Related Experiment Video
Updated: Aug 9, 2026

Stretching Short Sequences of DNA with Constant Force Axial Optical Tweezers
Published on: October 13, 2011
'Size leap' algorithm: an efficient extraction of the longest common motifs from a molecular sequence set.
A Danckaert1, C Chappey, S Hazout
1Unité de Recherches Biomathématiques et Biostatistiques, INSERM U263, Université Paris 7, France.
Abstract:
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.
More Related Videos
12:05A Simple, Robust, and High Throughput Single Molecule Flow Stretching Assay Implementation for Studying Transport of Molecules Along DNA
Published on: October 1, 2017
08:59High-Speed Atomic Force Microscopy Imaging of DNA Three-Point-Star Motif Self Assembly Using Photothermal Off-Resonance Tapping
Published on: March 22, 2024
Related Concept Videos
Evolutionary Relationships through Genome Comparisons
Sanger Sequencing
Next-generation Sequencing
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features.
Restriction Enzymes
The host bacteria protect their own genomic DNA from these enzymes by methylating these sites. Some...
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Modern Molecular Taxonomy