Results 21 to 30 of about 1,350 (116)
Sampling solution traces for the problem of sorting permutations by signed reversals
Algorithms for Molecular Biology, 2012 Background Traditional algorithms to solve the problem of sorting by signed reversals output just one optimal solution while the space of all optimal solutions can be huge.
Baudet Christian +2 more
doaj +1 more source
Sorting signed circular permutations by super short operations
Algorithms for Molecular Biology, 2018 Background One way to estimate the evolutionary distance between two given genomes is to determine the minimum number of large-scale mutations, or genome rearrangements, that are necessary to transform one into the other.
Andre R. Oliveira +3 more
doaj +1 more source
Sorting Circular Permutations by Reversal [PDF]
, 2003 Unsigned circular permutations are used to represent tours in the traveling salesman problem as well as the arrangement of gene loci in circular chromosomes. The minimum number of segment reversals required to transform one circular permutation into another gives some measure of distance between them which is useful when studying the 2-opt local search
Andrew Solomon +2 more
openaire +1 more source
Bounds for sorting by prefix reversal
Discrete Mathematics, 1979 AbstractFor a permutation σ of the integers from 1 to n, let ƒ(σ) be the smallest number of prefix reversals that will transform σ to the identity permutation, and let ƒ(n) be the largest such ƒ(σ) for all σ in (the symmetric group) Sn. We show that ƒ(n)⩽(5n+5)3, and that ƒ(n)⩾17n16 for n a multiple of 16.
William H. Gates +1 more
openaire +2 more sources
Sorting with fixed-length reversals
Discrete Applied Mathematics, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ting Chen, Steven Skiena
openaire +2 more sources
On the Sorting by Reversals and Transpositions Problem
J. Univers. Comput. Sci., 2017 JUCS - Journal of Universal Computer Science Volume Nr.
Oliveira,Andre +2 more
openaire +4 more sources
An easy case of sorting by reversals
Journal of Computational Biology, 1997 We show that a special case of sorting by reversals can be performed in polynomial time, namely, when the number of breakpoints is twice the distance.
openaire +5 more sources
Sorting permutations by cut-circularize-linearize-and-paste operations
BMC Genomics, 2011 Background Genome rearrangements are studied on the basis of genome-wide analysis of gene orders and important in the evolution of species. In the last two decades, a variety of rearrangement operations, such as reversals, transpositions, block ...
Huang Keng-Hsuan +2 more
doaj +1 more source
Listing all sorting reversals in quadratic time [PDF]
Algorithms for Molecular Biology, 2010 We describe an average-case O(n2) algorithm to list all reversals on a signed permutation π that, when applied to π, produce a permutation that is closer to the identity. This algorithm is optimal in the sense that, the time it takes to write the list is Ω(n2) in the worst case.
Swenson, Krister M +2 more
openaire +5 more sources
Average-Case Analysis of Perfect Sorting by Reversals [PDF]
Discrete Mathematics, Algorithms and Applications, 2009 Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any common interval. Bérard et al. (2007) make use of strong interval trees to describe an algorithm for sorting signed
Mathilde Bouvel +3 more
openaire +3 more sources