scientific article; zbMATH DE number 1947393
From MaRDI portal
Publication:4411359
Recommendations
- scientific article; zbMATH DE number 1303563
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- An approximation algorithm for sorting by reversals and transpositions
- Improved approximation for breakpoint graph decomposition and sorting by reversals
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions
Cited in
(53)- An approximation algorithm for sorting by reversals and transpositions
- Improved approximation for breakpoint graph decomposition and sorting by reversals
- A very elementary presentation of the Hannenhalli-Pevzner theory
- A further improved approximation algorithm for breakpoint graph decomposition
- (1+)-approximation of sorting by reversals and transpositions.
- Length-weighted \(\lambda\)-rearrangement distance
- Sorting a permutation by best short swaps
- Approximation algorithms for sorting permutations by length-weighted short rearrangements
- A new approach for the reversal distance with indels and moves in intergenic regions
- A 1.375-approximation algorithm for unsigned translocation sorting
- On sorting unsigned permutations by double-cut-and-joins
- An approximation algorithm for genome sorting by reversals to recover all adjacencies
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets
- Improved upper bound for sorting permutations by prefix transpositions
- An audit tool for genome rearrangement algorithms
- Sorting permutations by reversals through branch-and-price
- Approximating shortest connected graph transformation for trees
- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
- Efficient data structures and a new randomized approach for sorting signed permutations by reversals
- On sorting permutations by double-cut-and-joins
- scientific article; zbMATH DE number 1301598 (Why is no real title available?)
- scientific article; zbMATH DE number 1303563 (Why is no real title available?)
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
- scientific article; zbMATH DE number 2073943 (Why is no real title available?)
- Sorting by prefix reversals and prefix transpositions
- (1+ε)-Approximation of Sorting by Reversals and Transpositions
- Pancake flipping and sorting permutations
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
- A retrospective on genomic preprocessing for comparative genomics
- Kernelization of Whitney switches
- Approximation algorithms for sorting by length-weighted prefix and suffix operations
- Heuristics for reversal distance between genomes with duplicated genes
- Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals
- scientific article; zbMATH DE number 7286740 (Why is no real title available?)
- Combinatorial Pattern Matching
- A 14/11-approximation algorithm for sorting by short block-moves
- Algorithms – ESA 2005
- Kernelization of Whitney Switches
- Sorting by prefix block-interchanges
- scientific article; zbMATH DE number 7765413 (Why is no real title available?)
- Polynomial-time sortable stacks of burnt pancakes
- Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals
- Sorting permutations and binary strings by length-weighted rearrangements
- Improved approximation algorithm and hardness result for sorting unsigned strings by symmetric reversals
- On sorting by unsigned symmetric reversals
- Can the 1.375 approximation ratio of unsigned genomes distances be improved?
- Maximum alternating clean balanced cycle decomposition and applications in rearrangement distance problems
- Approximating reversal distance for strings with bounded number of duplicates
- A review of metrics on permutations for search landscape analysis
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations
- Improved bounds on sorting by length-weighted reversals
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 Q4411359)
