2-AIN-505, 2-AIN-251: Seminár z bioinformatiky (1) a (3)
Zima 2014
Abstrakt

Phillip E. C. Compeau. A Generalized Cost Model for DCJ-Indel Sorting. 2014.

Download preprint: not available

Download from publisher: http://link.springer.com/chapter/10.1007/978-3-662-44753-6_4

Related web page: not available

Bibliography entry: BibTeX

Abstract:

The double-cut-and-join operation (DCJ) is a fundamental graph
operation that is used to model a variety of genome
rearrangements. However, DCJs are only useful when comparing
genomes with equal (or nearly equal) gene content. One obvious
extension of the DCJ framework supplements DCJs with insertions
and deletions of chromosomes and chromosomal intervals, which
implies a model in which DCJs receive unit cost, whereas
insertions and deletions receive a nonnegative cost of ω. This
paper proposes a unified model finding a minimum-cost
transformation of one genome (with circular chromosomes) into
another genome for any value of ω. In the process, it resolves
the open case ω > 1.