Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? (Q4632186): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1007/978-3-319-39817-4_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2486810668 / 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: Q4234063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tightness of the alternating-cycle lower bound for sorting by reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of the Exemplar Breakpoint Distance Problem / rank
 
Normal rank

Latest revision as of 01:26, 19 July 2024

scientific article; zbMATH DE number 7048087
Language Label Description Also known as
English
Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?
scientific article; zbMATH DE number 7048087

    Statements

    Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? (English)
    0 references
    0 references
    0 references
    26 April 2019
    0 references
    breakpoint graph
    0 references
    genome rearrangement
    0 references
    cycle decomposition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references