An alternative algebraic formalism for genome rearrangements

zbMATH Open1137.92341MaRDI QIDQ5457093FDOQ5457093

Authors: João Meidanis, Zanoni Dias 

Publication date: 14 April 2008

Recommendations

• A new algebraic approach to genome rearrangement models
• An algebraic view of bacterial genome evolution
• Genome rearrangements: a correct algorithm for optimal capping
• Genome Rearrangements and Sorting by Reversals
• On the similarity of sets of permutations and its applications to genome comparison

Mathematics Subject Classification ID

Genetics and epigenetics (92D10)

Cited In (16)

• The complexity of genome rearrangement combinatorics under the infinite sites model
• Group-theoretic models of the inversion process in bacterial genomes
• Algebraic double cut and join: A group-theoretic approach to the operator on multichromosomal 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
• Rearrangement events on circular genomes
• An improved algorithm for sorting by block-interchanges based on permutation groups
• 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
• Title not available (Why is that?)
• 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)