Sorting by reversals, block interchanges, tandem duplications, and deletions
نویسندگان
چکیده
منابع مشابه
Perfect Sorting by Reversals and Deletions/Insertions
Recently, more and more people are interested in the problem of computing a sequence of rearrangement operations to transform one genome into the other such that these operations conserve all common intervals. Bérard et al. show an algorithm to solve the problem in subquadratic time when all operations are reversals. In this paper, we extend the result to allow deletions and a limited form of i...
متن کاملlog-Lists and their applications to sorting by transpositions, reversals and block-interchanges
Link-cut trees have been introduced by D.D. Sleator and R.E. Tarjan (Journal of Computer and System Sciences, 1983) with the aim of efficiently maintaining a forest of vertex-disjoint dynamic rooted trees under cut and link operations. These operations respectively disconnect a subtree from a tree, and join two trees by an edge. Additionally, link-cut trees allow to change the root of a tree an...
متن کاملAn O(n3) algorithm for sorting signed genomes by reversals, transpositions, transreversals and block-interchanges
We consider the problem of sorting signed permutations by reversals, transpositions, transreversals, and block-interchanges. The problem arises in the study of species evolution via large-scale genome rearrangement operations. Recently, Hao et al. gave a 2-approximation scheme called genome sorting by bridges (GSB) for solving this problem. Their result extended and unified the results of (i) H...
متن کاملSorting by Prefix Reversals
The pancake problem, which has attracted considerable attention, concerns the number of prefix reversals needed to sort the elements of an arbitrary permutation. The number of prefix reversals to sort permutations is also the diameter of the often studied n-dimensional Pancake network. We consider restricted pancake problem, when only k of the possible n− 1 prefix reversals are allowed.
متن کاملSorting by reversals
One of the most studied problems in the field of computational biology is the string matching problem. Much of the reasearch has focused on developing efficient algorithms for transforming one string into another by minimizing the number of steps. The biological motivation for this problem comes from the fact that DNA sequences get transformed by a series of basic operations such as mutations, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2009
ISSN: 1471-2105
DOI: 10.1186/1471-2105-10-s1-s9