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):
Displaying 34 items.
- A fast algorithm for multiplying min-sum permutations (Q411869) (← links)
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations (Q655439) (← links)
- The complexity of genome rearrangement combinatorics under the infinite sites model (Q827869) (← links)
- Advances on sorting by reversals (Q876490) (← links)
- An efficient algorithm for one-sided block ordering problem under block-interchange distance (Q897897) (← 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 more efficient algorithm for perfect sorting by reversals (Q963340) (← links)
- An improved algorithm for sorting by block-interchanges based on permutation groups (Q991802) (← 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)
- Sorting by reversals and the theory of 4-regular graphs (Q1682854) (← links)
- Sorting signed permutations by reversals using link-cut trees (Q1705654) (← 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)
- Sorting a permutation by best short swaps (Q2037101) (← links)
- A 1.375-approximation algorithm for unsigned translocation sorting (Q2186826) (← links)
- How to sort by walking and swapping on paths and trees (Q2408166) (← 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)
- Transforming cabbage into turnip (Q3158530) (← 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)
- A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)
- Combinatorial Pattern Matching (Q5315321) (← links)
- Combinatorial Pattern Matching (Q5315346) (← links)
- SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS (Q5484911) (← links)
- An improved genetic algorithm for problem of genome rearrangement (Q5492501) (← links)
- Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals (Q6591644) (← links)
