Results 11 to 20 of about 1,718 (234)
Sorting by reversals and the theory of 4-regular graphs
Theoretical Computer Science, 2017 We show that the theory of sorting by reversals fits into the well-established theory of circuit partitions of 4-regular multigraphs (which also involves the combinatorial structures of circle graphs and delta-matroids). In this way, we expose strong connections between the two theories that have not been fully appreciated before.
Robert Brijder
exaly +6 more sources
Sorting by Reversals in Subquadratic Time [PDF]
, 2004 The problem of sorting by signed reversals is inspired by a genome rearrangement problem in computational molecular biology. Given two genomes represented as signed permutations of the same elements (e.g. orthologous genes), the problem consists in finding a most parsimonious scenario of reversals that transforms one genome into the other. We propose a
Tannier, Eric, Sagot, Marie-France
core +6 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 +3 more sources
Perfect Sorting by Reversals [PDF]
, 2005 In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that is, genes that are co-localised in several species, indicating that they remained grouped during evolution.
Sagot, Marie-France, Tannier, Eric
core +6 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
core +6 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.
Tran, Nicholas
openaire +6 more sources
Sorting by Restricted-Length-Weighted Reversals
Genomics, Proteomics & Bioinformatics, 2005 Abstract Classical sorting by reversals uses the unit-cost model, that is, each reversal consumes an equal cost. This model limits the biological meaning of sorting by reversal. Bender and his colleagues extended it by assigning a cost function f(l) = lα for all α ≥ 0, where l is the length of the reversed subsequence.
Nguyen, Thach Cam +2 more
openaire +3 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 +5 more sources
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions [PDF]
Journal of Computational Biology, 2006 During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chromosome (like mitochondrial, chloroplast, or bacterial genomes), the biologically relevant genome rearrangements are (1) inversions--also called reversals--where a section of the genome ...
Martin Bader, Enno Ohlebusch
openaire +3 more sources
(1+ε)-Approximation of Sorting by Reversals and Transpositions
Theoretical Computer Science, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eriksen, Niklas, +2 more
openaire +3 more sources