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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2007.10.012 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2007.10.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088853706 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2007.10.012 / rank
 
Normal rank

Latest revision as of 10:12, 10 December 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