Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? (Q4632186): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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
26 April 2019
0 references
breakpoint graph
0 references
genome rearrangement
0 references
cycle decomposition
0 references
