Related Experiment Video
Updated: Aug 18, 2026

Use of Alu Element Containing Minigenes to Analyze Circular RNAs
Published on: March 10, 2020
A novel algorithm for finding interspersed repeat regions
Abstract:
The analysis of repeats in the DNA sequences is an important subject in bioinformatics. In this paper, we propose a novel projection-assemble algorithm to find unknown interspersed repeats in DNA sequences. The algorithm employs random projection algorithm to obtain a candidate fragment set, and exhaustive search algorithm to search each pair of fragments from the candidate fragment set to find potential linkage, and then assemble them together. The complexity of our projection-assemble algorithm is nearly linear to the length of the genome sequence, and its memory usage is limited by the hardware. We tested our algorithm with both simulated data and real biology data, and the results show that our projection-assemble algorithm is efficient. By means of this algorithm, we found an un-labeled repeat region that occurs five times in Escherichia coli genome, with its length more than 5,000 bp, and a mismatch probability less than 4%.
Related Concept Videos
Conservative Site-specific Recombination and Phase Variation
The recognition sites for Cre recombinase called LoxP...
Homologous Recombination
Homologous Recombination
Mismatch Repair
Mismatch Repair
The Mutator Protein Family Plays a Key Role in DNA Mismatch Repair
The human genome has more than 3 billion base pairs of DNA per cell. Prior to cell division, that vast amount of genetic...
Exon Recombination
Exon shuffling follows “splice frame rules.” Each exon has three reading...

