scientific article; zbMATH DE number 1830749

MaRDI QIDQ4778571zbMATH OpenFDO

Authors David A. Bader, Bernard M. E. Moret, Mi Yan

Publication date 18 November 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2125/21250365

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Recommendations

• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Genome Rearrangements and Sorting by Reversals
• Sorting signed permutations by reversals, revisited
• Combinatorial Pattern Matching

Cited in

(12)

• Maximum likelihood estimates of rearrangement distance: implementing a representation-theoretic approach
• A new algebraic approach to genome rearrangement models
• Plane permutations and applications to a result of Zagier-Stanley and distances of permutations
• An audit tool for genome rearrangement algorithms
• Exemplar or matching: modeling DCJ problems with unequal content genome data
• Parallel algorithms for the reversal distance of permutations on PRAM and LARPBS
• Succinct representations of permutations and functions
• A sparse dynamic programming algorithm for alignment with non-overlapping inversions
• A retrospective on genomic preprocessing for comparative genomics
• Bacterial phylogeny in the Cayley graph
• Rearrangement events on circular genomes
• Advances on sorting by reversals

Describes a project that uses

Uses Software

• GRAPPA

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778571)