A more efficient algorithm for perfect sorting by reversals (Q963340): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / 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: Average-Case Analysis of Perfect Sorting by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4679085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on sorting by reversals / rank
 
Normal rank

Revision as of 16:31, 2 July 2024

scientific article
Language Label Description Also known as
English
A more efficient algorithm for perfect sorting by reversals
scientific article

    Statements

    A more efficient algorithm for perfect sorting by reversals (English)
    0 references
    0 references
    0 references
    0 references
    19 April 2010
    0 references
    algorithms
    0 references
    sorting by reversals
    0 references
    common intervals
    0 references

    Identifiers