A very elementary presentation of the Hannenhalli-Pevzner theory
From MaRDI portal
Publication:1764894
DOI10.1016/j.dam.2004.04.010zbMath1084.68086OpenAlexW1980890118MaRDI QIDQ1764894
Publication date: 22 February 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2004.04.010
Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)
Related Items (13)
A topological framework for signed permutations ⋮ Heuristics for Reversal Distance Between Genomes with Duplicated Genes ⋮ Sorting by \(k\)-cuts on signed permutations ⋮ Sorting by reversals and the theory of 4-regular graphs ⋮ Sorting permutations: Games, genomes, and cycles ⋮ Successful pressing sequences for a bicolored graph and binary matrices ⋮ Polynomial-time sortable stacks of burnt pancakes ⋮ On the flip graphs on perfect matchings of complete graphs and signed reversal graphs ⋮ Sequential vs. Parallel complexity in simple gene assembly ⋮ An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations ⋮ Patterns of simple gene assembly in ciliates ⋮ Word length perturbations in certain symmetric presentations of dihedral groups ⋮ Cycles in the burnt pancake graph
Cites Work
This page was built for publication: A very elementary presentation of the Hannenhalli-Pevzner theory
