scientific article; zbMATH DE number 1830749

zbMath0997.68527MaRDI QIDQ4778571

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

Publication date: 18 November 2002

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (11)

A new algebraic approach to genome rearrangement models ⋮ Exemplar or matching: modeling DCJ problems with unequal content genome data ⋮ Advances on sorting by reversals ⋮ Rearrangement events on circular genomes ⋮ Succinct representations of permutations and functions ⋮ Maximum likelihood estimates of rearrangement distance: implementing a representation-theoretic approach ⋮ A sparse dynamic programming algorithm for alignment with non-overlapping inversions ⋮ Plane Permutations and Applications to a Result of Zagier--Stanley and Distances of Permutations ⋮ An Audit Tool for Genome Rearrangement Algorithms ⋮ A Retrospective on Genomic Preprocessing for Comparative Genomics ⋮ Bacterial phylogeny in the Cayley graph

Uses Software

• GRAPPA

This page was built for publication: