Sorting Cancer Karyotypes By Elementary Operations

Below is result for Sorting Cancer Karyotypes By Elementary Operations in PDF format. You can download or read online all document for free, but please respect copyrighted ebooks. This site does not host PDF files, all document are the property of their respective owners.

Sorting cancer karyotypes by elementary operations

Sorting cancer karyotypes by elementary operations Michal Ozery-Flato and Ron Shamir School of Computer Science, Tel-Aviv University, Tel Aviv 69978, Israel {ozery,rshamir}@post.tau.ac.il Abstract. Since the discovery of the Philadelphia chromosome in chronic myelogenous leukemia in 1960, there is an ongoing intensive re-

Universit at Ulm

algorithm for sorting by transpositions, and extend it to sorting by weighted reversals and transpositions. We introduce a new pairwise distance measure which also considers operations that change the genome content, namely tandem duplications and deletions. We develop a lower bound for this distance and a greedy algorithm based on this lower

Sorting Cancer Karyotypes by Elementary Operations

sorting cancer karyotypes by elementary operations 1447 [5, 1] is broken within band 3, then the resulting fragments are generally denoted the by [5, 3] and [3, 1]. For this reason, we do not consider the concatenation [5, 3]::[2, 1] as an adjacency.