| Literature DB >> 24751867 |
Broňa Brejová1, Martin Kravec, Gad M Landau, Tomaš Vinař.
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.Entities:
Keywords: duplication; dynamic text; edit distance; sequence evolution
Year: 2014 PMID: 24751867 PMCID: PMC3996574 DOI: 10.1098/rsta.2013.0133
Source DB: PubMed Journal: Philos Trans A Math Phys Eng Sci ISSN: 1364-503X Impact factor: 4.226