Pages that link to "Item:Q2706200"
From MaRDI portal
The following pages link to Sorting Strings by Reversals and by Transpositions (Q2706200):
Displaying 17 items.
- Minimum common string partition revisited (Q437061) (← links)
- Prefix and suffix transreversals on binary and ternary strings (Q491633) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- Approximating reversal distance for strings with bounded number of duplicates (Q868388) (← links)
- Prefix and suffix reversals on strings (Q1647842) (← links)
- Quick greedy computation for minimum common string partition (Q2015138) (← links)
- Permutation-constrained common string partitions with applications (Q2146123) (← links)
- A new approach for the reversal distance with indels and moves in intergenic regions (Q2163962) (← links)
- The complexity of string partitioning (Q2343298) (← links)
- An approximation algorithm for genome sorting by reversals to recover all adjacencies (Q2424720) (← links)
- Multiple genome rearrangement by swaps and by element duplications (Q2456364) (← links)
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets (Q2628806) (← links)
- A NOTE ON COMPLEXITY OF GENETIC MUTATIONS (Q2890984) (← links)
- Prefix and Suffix Reversals on Strings (Q2949837) (← links)
- Quick Greedy Computation for Minimum Common String Partitions (Q3011861) (← links)
- Sorting by Transpositions Is Difficult (Q3012840) (← links)
- Kernelization of Whitney Switches (Q5874518) (← links)
