scientific article; zbMATH DE number 1947393
From MaRDI portal
Publication:4411359
zbMath1019.68817MaRDI QIDQ4411359
Piotr Berman, Sridhar Hannenhalli, Marek Karpinski
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610200.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (33)
Heuristics for Reversal Distance Between Genomes with Duplicated Genes ⋮ Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals ⋮ Approximation algorithms for sorting permutations by length-weighted short rearrangements ⋮ (Prefix) reversal distance for (signed) strings with few blocks or small alphabets ⋮ A new approach for the reversal distance with indels and moves in intergenic regions ⋮ Approximating reversal distance for strings with bounded number of duplicates ⋮ A review of metrics on permutations for search landscape analysis ⋮ Improved upper bound for sorting permutations by prefix transpositions ⋮ A 1.375-approximation algorithm for unsigned translocation sorting ⋮ Sorting by prefix block-interchanges ⋮ An approximation algorithm for genome sorting by reversals to recover all adjacencies ⋮ A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations ⋮ Polynomial-time sortable stacks of burnt pancakes ⋮ A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations ⋮ A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations ⋮ Unnamed Item ⋮ Improved bounds on sorting by length-weighted reversals ⋮ Sorting by prefix reversals and prefix transpositions ⋮ Approximating Shortest Connected Graph Transformation for Trees ⋮ Pancake flipping and sorting permutations ⋮ Pancake flipping is hard ⋮ Approximation algorithms for sorting by length-weighted prefix and suffix operations ⋮ Sorting permutations and binary strings by length-weighted rearrangements ⋮ A 14/11-approximation algorithm for sorting by short block-moves ⋮ A simpler and faster 1.5-approximation algorithm for sorting by transpositions ⋮ Length-weighted \(\lambda\)-rearrangement distance ⋮ Sorting a permutation by best short swaps ⋮ An approximation algorithm for sorting by reversals and transpositions ⋮ An Audit Tool for Genome Rearrangement Algorithms ⋮ Unnamed Item ⋮ A Retrospective on Genomic Preprocessing for Comparative Genomics ⋮ Kernelization of Whitney Switches ⋮ Kernelization of Whitney Switches
This page was built for publication:
