On sorting unsigned permutations by double-cut-and-joins (Q2377380): 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/s10878-010-9369-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003985385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genome Rearrangements and Sorting by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation for breakpoint graph decomposition and sorting by reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A further improved approximation algorithm for breakpoint graph decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector-valued wavelets with triangular support for method of moments applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:00, 6 July 2024

scientific article
Language Label Description Also known as
English
On sorting unsigned permutations by double-cut-and-joins
scientific article

    Statements

    On sorting unsigned permutations by double-cut-and-joins (English)
    0 references
    0 references
    28 June 2013
    0 references
    genome rearrangement
    0 references
    double-cut-and-joins
    0 references
    breakpoint graph decomposition
    0 references
    fractional linear programming
    0 references

    Identifiers