Average-Case Analysis of Perfect Sorting by Reversals

@article{Bouvel2011AverageCaseAO,
  title={Average-Case Analysis of Perfect Sorting by Reversals},
  author={Mathilde Bouvel and C{\'e}dric Chauve and Marni Mishna and Dominique Rossin},
  journal={ArXiv},
  year={2011},
  volume={abs/0901.2847}
}
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of computing a parsimonious perfect sequence of reversals is believed to be NP-hard, as the more general problem of sorting a signed permutation by reversals while preserving a given subset of common intervals is NP-hard. The only published algorithms that compute a parsimonious perfect reversals sequence have an… 

Figures from this paper

Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes

TLDR
It is shown that computing the minimum perfect DCJ rearrangement scenario is NP-hard, and an exact algorithm which exponential running time is bounded in terms of a specific pattern used in the NP-completeness proof is described.

Some Families of Trees Arising in Permutation Analysis

TLDR
A filtration of the set of permutations based on their strong interval trees is described, illustrating the convergence of analytic series towards a non-analytic limit at the level of the asymptotic behavior of their coefficients.

A decorated tree approach to random permutations in substitution-closed classes

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from

Some simple varieties of trees arising in permutation analysis

TLDR
This work describes a filtration of the set of permutations based on their strong interval trees, and provides asymptotic formulas for number of trees (by leaves), average number of nodes of fixed arity, average subtree size sum, andaverage number of internal nodes.

Asymptotic behavior of some statistics in Ewens random permutations

The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model of random permutations considered here is Ewens

Preserving Inversion Phylogeny Reconstruction

TLDR
A linear-time algorithm for the small parsimony problem (inferring ancestral genomes given a phylogeny on an arbitrary number of genomes) in the case gene orders are permutations, that evolve by inversions not breaking common gene intervals, and these intervals are organised in a linear structure is presented.

The rise and fall of breakpoint reuse depending on genome resolution

TLDR
The inferred breakpoint reuse rate depends on synteny block resolution in human-mouse genome comparisons, and at fine-scale resolution, the cycle structure for the transformation appears less random compared to that for coarse resolution.

Algorithms in Bioinformatics

TLDR
A linear-time algorithm for the small parsimony problem (inferring ancestral genomes given a phylogeny on an arbitrary number of genomes) in the case gene orders are permutations, that evolve by inversions not breaking common gene intervals, and these intervals are organised in a linear structure is presented.

Genome Rearrangement Analysis: Cut and Join Genome Rearrangements and Gene Cluster Preserving Approaches.

TLDR
In this chapter, the border between algorithmically "easy" and "hard" rearrangement problems is sketched and a brief review is given on the available software tools for genome rearrangements analysis.

References

SHOWING 1-10 OF 51 REFERENCES

Perfect Sorting by Reversals Is Not Always Difficult

TLDR
A combinatorial framework is described that allows us to characterize classes of signed permutations for which one can compute, in polynomial time, a shortest reversal scenario that conserves all common intervals.

Advances on sorting by reversals

A more efficient algorithm for perfect sorting by reversals

Sorting by Reversals with Common Intervals

TLDR
It is proposed to revisit the ’sorting by reversals’ problem by adding constraints on allowed reversals and it is shown that this problem is NP-complete.

Common intervals in permutations

TLDR
The distribution of the number of intervals of a uniform random permutation is analyzed via a multivariate generating function enumerating pairs of potential 2-intervals by size and intersection size and finds that the quenched and annealed means are the same.

Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes

TLDR
It is shown that computing the minimum perfect DCJ rearrangement scenario is NP-hard, and an exact algorithm which exponential running time is bounded in terms of a specific pattern used in the NP-completeness proof is described.

Simple permutations and pattern restricted permutations

Evolution under Reversals: Parsimony and Conservation of Common Intervals

TLDR
A solution is given to the problem of computing a minimum scenario of reversals that transforms a signed permutation into another and it is proved that this widens the class of permutations addressed by two recent studies.

Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution

TLDR
An algorithm which gives all the classes of solutions and counts the number of solutions in each class, with a better theoretical and practical complexity than the complete enumeration method is proposed.

Fast Algorithms to Enumerate All Common Intervals of Two Permutations

TLDR
The results indicate that (i) LHP and MNG are much faster than RC for two randomly generated permutations, and (ii) MNG is rather slower than LHP for random inputs; however, there are cases in which LHP requires Ω(n2) time, but MNG runs in o(n 2) time and is faster than both LHP.
...