A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q4547739 / 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: Q4250188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting a bridge hand / 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: Transforming cabbage into turnip / 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: A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed genome rearrangement by reversals and transpositions: Models and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Working on the Problem of Sorting by Transpositions on Genome Rearrangements / rank
 
Normal rank

Latest revision as of 12:34, 24 June 2024

scientific article
Language Label Description Also known as
English
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
scientific article

    Statements

    A simpler and faster 1.5-approximation algorithm for sorting by transpositions (English)
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    Computational biology
    0 references
    Genome rearrangements
    0 references
    Sorting permutations by transpositions
    0 references

    Identifiers