Pages that link to "Item:Q4943850"
From MaRDI portal
The following pages link to A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals (Q4943850):
Displayed 17 items.
- Advances on sorting by reversals (Q876490) (← links)
- A linear time algorithm for the inversion median problem in circular bacterial genomes (Q925057) (← links)
- Patterns of simple gene assembly in ciliates (Q948679) (← links)
- Decision problem for shuffled genes (Q958310) (← links)
- A new linear time algorithm to compute the genomic distance via the double cut and join distance (Q1038470) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
- A very elementary presentation of the Hannenhalli-Pevzner theory (Q1764894) (← links)
- Sorting signed permutations by reversals, revisited (Q1775771) (← links)
- Efficient algorithms for multichromosomal genome rearrangements. (Q1872727) (← links)
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115) (← links)
- Generating a random signed permutation with random reversals (Q2576806) (← links)
- A 1.75-approximation algorithm for unsigned translocation distance (Q2643729) (← links)
- Simple Operations for Gene Assembly (Q3618682) (← links)
- SUCCESSFUL ELEMENTARY GENE ASSEMBLY STRATEGIES (Q3636157) (← links)
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions (Q4680734) (← links)
- SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS (Q5484911) (← links)
- An improved genetic algorithm for problem of genome rearrangement (Q5492501) (← links)