Pages that link to "Item:Q4255810"
From MaRDI portal
The following pages link to Sorting Permutations by Reversals and Eulerian Cycle Decompositions (Q4255810):
Displayed 19 items.
- A 14/11-approximation algorithm for sorting by short block-moves (Q543206) (← links)
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- Polynomial-time sortable stacks of burnt pancakes (Q627167) (← links)
- The transposition median problem is NP-complete (Q631772) (← links)
- Structural properties and tractability results for linear synteny (Q876715) (← links)
- Expected number of breakpoints after \(t\) random reversals in genomes with duplicate genes (Q947117) (← links)
- A more efficient algorithm for perfect sorting by reversals (Q963340) (← links)
- Packing edge-disjoint cycles in graphs and the cyclomatic number (Q968414) (← links)
- Sorting by bounded block-moves (Q1281770) (← links)
- \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions. (Q1853543) (← links)
- Estimate the distance of genome rearrangements by reversals (Q2385374) (← links)
- Multiple genome rearrangement by swaps and by element duplications (Q2456364) (← links)
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115) (← links)
- Predatory search algorithm with restriction of solution distance (Q2500224) (← links)
- COMPUTING SIGNED PERMUTATIONS OF POLYGONS (Q3007725) (← links)
- Edit Distances and Factorisations of Even Permutations (Q3541123) (← links)
- Statistical and Combinatorial Aspects of Comparative Genomics* (Q4677089) (← links)
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions (Q4680734) (← links)
- An improved genetic algorithm for problem of genome rearrangement (Q5492501) (← links)