Sorting permutations and binary strings by length-weighted rearrangements (Q683752): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2018.01.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2787532231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting Permutations by Reversals and Eulerian Cycle Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genome Rearrangements and Sorting by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming cabbage into turnip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on sorting by reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting by Transpositions Is Difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting a bridge hand / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for sorting by reversals and transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for sorting by prefix reversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Diameter of the Pancake Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \((18/11)n\) upper bound for sorting by prefix reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancake flipping is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On average and highest number of flips in pancake sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the problem of sorting burnt pancakes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edit Distances and Factorisations of Even Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding prefix transposition distance for strings and permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting by prefix reversals and prefix transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computational biology. First international conference, AlCoB 2014, Tarragona, Spain, July 1--3, 2014. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prefix and Suffix Reversals on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on sorting by length-weighted reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for sorting by length-weighted prefix and suffix operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3393448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank

Revision as of 02:16, 15 July 2024

scientific article
Language Label Description Also known as
English
Sorting permutations and binary strings by length-weighted rearrangements
scientific article

    Statements

    Sorting permutations and binary strings by length-weighted rearrangements (English)
    0 references
    0 references
    0 references
    0 references
    9 February 2018
    0 references
    genome rearrangements
    0 references
    reversals
    0 references
    transpositions
    0 references
    prefix rearrangements
    0 references
    diameter
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references