Pages that link to "Item:Q2890984"
From MaRDI portal
The following pages link to A NOTE ON COMPLEXITY OF GENETIC MUTATIONS (Q2890984):
Displayed 6 items.
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- Approximation algorithms for sorting permutations by extreme block-interchanges (Q2235751) (← links)
- Layered graphs: applications and algorithms (Q2287476) (← links)
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets (Q2628806) (← links)
- UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE (Q4928334) (← links)
- Exact upper bound for sorting Rn with LE (Q4965903) (← links)