Results 1 to 10 of about 1,347 (116)
Sorting by reversals and block-interchanges with various weight assignments [PDF]
BMC Bioinformatics, 2009 Background A classical problem in studying genome rearrangements is understanding the series of rearrangement events involved in transforming one genome into another in accordance with the parsimonious principle when two genomes with the same set of ...
Lin Chunhung, Lin Chun-Yuan, Lin Ying
doaj +2 more sources
An asymmetric approach to preserve common intervals while sorting by reversals [PDF]
Algorithms for Molecular Biology, 2009 Background The reversal distance and optimal sequences of reversals to transform a genome into another are useful tools to analyse evolutionary scenarios.
Gautier Christian +2 more
doaj +2 more sources
Sorting by reversals, block interchanges, tandem duplications, and deletions [PDF]
BMC Bioinformatics, 2009 Background Finding sequences of evolutionary operations that transform one genome into another is a classic problem in comparative genomics. While most of the genome rearrangement algorithms assume that there is exactly one copy of each gene in both ...
Bader Martin
doaj +2 more sources
An improved approximation algorithm for the reversal and transposition distance considering gene order and intergenic sizes [PDF]
Algorithms for Molecular Biology, 2021 Background In the comparative genomics field, one of the goals is to estimate a sequence of genetic changes capable of transforming a genome into another.
Klairton L. Brito +4 more
doaj +2 more sources
baobabLUNA: the solution space of sorting by reversals. [PDF]
Bioinformatics, 2009 Abstract Summary: Computing the reversal distance and searching for an optimal sequence of reversals to transform a unichromosomal genome into another are useful algorithmic tools to analyse real evolutionary scenarios. Currently, these problems can be solved by at least two available softwares, the prominent of which are GRAPPA and ...
Braga MD.
europepmc +4 more sources
An approximation algorithm for sorting by reversals and transpositions
Journal of Discrete Algorithms, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Atif Rahman +2 more
exaly +3 more sources
Advances on sorting by reversals
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eric Tannier +2 more
exaly +4 more sources
Sorting by Prefix Reversals and Prefix Transpositions
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zanoni Dias, Ulisses Dias
exaly +3 more sources
A more efficient algorithm for perfect sorting by reversals [PDF]
Information Processing Letters, 2008 We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum prime degree $d$ of the strong interval tree, i.e. $f(d).n^{O(1)}$. This improves the best known algorithm which complexity was based on a parameter always larger than or ...
Cedric Chauve, Christophe Paul
exaly +3 more sources
Sorting signed permutations by reversals, revisited
Journal of Computer and System Sciences, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haim Kaplan
exaly +2 more sources