Related Experiment Video
Updated: May 1, 2026

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation
Published on: December 29, 2021
Fast computation of a string duplication history under no-breakpoint-reuse
Broňa Brejová1, Martin Kravec, Gad M Landau
1Faculty of Mathematics, Physics and Informatics, Comenius University, , Mlynská dolina, 842 48 Bratislava, Slovakia.
Abstract:
In this paper, we provide an O(n log(2) n log log n log* n) algorithm to compute a duplication history of a string under no-breakpoint-reuse condition. The motivation of this problem stems from computational biology, in particular, from analysis of complex gene clusters. The problem is also related to computing edit distance with block operations, but, in our scenario, the start of the history is not fixed, but chosen to minimize the distance measure.
More Related Videos
05:22Author Spotlight: Characterizing DNA Replication of Pathogenic Repeats to Uncover Mechanisms of Replication Fork Stalling and Expansion
Published on: September 13, 2024
07:18Visualization of DNA Replication in the Vertebrate Model System DT40 using the DNA Fiber Technique
Published on: October 27, 2011
Related Concept Videos
Lagging Strand Synthesis
There are several major differences between synthesis of the leading strand and synthesis of the lagging strand. 1) Leading strand synthesis happens in the direction of replication fork opening, whereas lagging strand synthesis happens in the...
Lagging Strand Synthesis
Fixing Double-strand Breaks
Fixing Double-strand Breaks
Restarting Stalled Replication Forks
Restarting Stalled Replication Forks