A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations (Q3511344): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/978-3-540-69733-6_33 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133671047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting by Transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411359 / 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: A 2-approximation algorithm for genome rearrangements by reversals and transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234063 / 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: Combinatorial Pattern Matching / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:12, 28 June 2024

scientific article
Language Label Description Also known as
English
A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
scientific article

    Statements

    Identifiers