Fast computation of a string duplication history under no-breakpoint-reuse

Brona Brejová, Martin Kravec, Gad M. Landau, Tomás Vinar

Research output: Contribution to journalArticlepeer-review


In this paper, we provide an O(n log2 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, fromanalysis 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.

Original languageEnglish
Article number20130133
JournalPhilosophical transactions. Series A, Mathematical, physical, and engineering sciences
StatePublished - 28 May 2014


  • Duplication
  • Dynamic text
  • Edit distance
  • Sequence evolution

ASJC Scopus subject areas

  • General Mathematics
  • General Engineering
  • General Physics and Astronomy


Dive into the research topics of 'Fast computation of a string duplication history under no-breakpoint-reuse'. Together they form a unique fingerprint.

Cite this