Pages that link to "Item:Q5941291"
From MaRDI portal
The following pages link to Signed genome rearrangement by reversals and transpositions: Models and approximations (Q5941291):
Displayed 10 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- Approximation algorithms for sorting by length-weighted prefix and suffix operations (Q500990) (← links)
- Multi-break rearrangements and chromosomal evolution (Q932316) (← links)
- A new approximation algorithm for sorting of signed permutations (Q1400064) (← links)
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations (Q2099384) (← links)
- Sorting by \(k\)-cuts on signed permutations (Q2163961) (← links)
- Optimal algorithms for uncovering synteny problem (Q2385477) (← links)
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115) (← links)
- The Cayley network of expanded Pancake graphs (Q5712016) (← links)
- Rearrangement events on circular genomes (Q6078306) (← links)