Pages that link to "Item:Q2890984"
From MaRDI portal
The following pages link to A note on complexity of genetic mutations (Q2890984):
Displaying 11 items.
- Experimental efficiency of programmed mutagenesis (Q698889) (← links)
- 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)
- On the complexity of average path length for biological networks and patterns (Q2922126) (← links)
- Mutation Systems (Q3004569) (← links)
- (Q4252311) (← links)
- UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE (Q4928334) (← links)
- Exact upper bound for sorting Rn with LE (Q4965903) (← links)
- A basic model of mutations (Q5140342) (← links)