Bounding prefix transposition distance for strings and permutations (Q764373): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q740975 / rank
Normal rank
 
Property / author
 
Property / author: Ivan Hal Sudborough / rank
 
Normal rank
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.2011.11.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002871031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genome Rearrangements and Sorting by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting by Transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Sorting is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting by Transpositions Is Difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NOTE ON COMPLEXITY OF GENETIC MUTATIONS / 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: Adjacent Swaps on Strings / 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: Sorting Strings by Reversals and by Transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string edit distance matching problem with moves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs for cut-and-paste sorting of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting a bridge hand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3393448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum common string partition problem: hardness and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler and faster 1.5-approximation algorithm for sorting by 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: Sorting by bounded block-moves / 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: Prefix Reversals on Binary and Ternary Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement / 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: Reversals and Transpositions Over Finite Alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737692 / rank
 
Normal rank

Latest revision as of 00:29, 5 July 2024

scientific article
Language Label Description Also known as
English
Bounding prefix transposition distance for strings and permutations
scientific article

    Statements

    Bounding prefix transposition distance for strings and permutations (English)
    0 references
    13 March 2012
    0 references
    0 references
    approximation
    0 references
    bounds
    0 references
    complexity
    0 references
    prefix transpositions
    0 references
    0 references