An alternative algebraic formalism for genome rearrangements
From MaRDI portal
Publication:5457093
Recommendations
Cited in
(16)- The complexity of genome rearrangement combinatorics under the infinite sites model
- Algebraic double cut and join: A group-theoretic approach to the operator on multichromosomal genomes
- Group-theoretic models of the inversion process in bacterial genomes
- The structure and representation of \(n\)-ary algebras of DNA recombination
- A new algebraic approach to genome rearrangement models
- The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances
- Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions
- An improved algorithm for sorting by block-interchanges based on permutation groups
- Rearrangement events on circular genomes
- An algebraic view of bacterial genome evolution
- On the average number of reversals needed to sort signed permutations
- The genesis of the DCJ formula
- Combinatorics of chromosomal rearrangements based on synteny blocks and synteny packs
- scientific article; zbMATH DE number 5368453 (Why is no real title available?)
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations
This page was built for publication: An alternative algebraic formalism for genome rearrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5457093)