Improved bounds on sorting by length-weighted reversals (Q931719): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1016/j.jcss.2007.08.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037187792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genome Rearrangements and Sorting by Reversals / 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: Transforming cabbage into turnip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank

Latest revision as of 11:45, 28 June 2024

scientific article
Language Label Description Also known as
English
Improved bounds on sorting by length-weighted reversals
scientific article

    Statements

    Improved bounds on sorting by length-weighted reversals (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2008
    0 references
    sorting by reversals
    0 references
    potential functions
    0 references
    dynamic programming
    0 references
    sorting 0/1 sequences by reversals
    0 references
    modeling genome rearrangements
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers