Combinatorics of genome rearrangements.
From MaRDI portal
Publication:3393448
Recommendations
Cited in
(98)- Bacterial phylogeny in the Cayley graph
- The potential of family-free genome comparison
- Revisiting the parameterized complexity of maximum-duo preservation string mapping
- Packing Euler graphs with traces
- Metric intersection problems in Cayley graphs and the Stirling recursion
- On the effective and automatic enumeration of polynomial permutation classes
- The complexity of genome rearrangement combinatorics under the infinite sites model
- Sorting by multi-cut rearrangements
- Maximum likelihood estimates of rearrangement distance: implementing a representation-theoretic approach
- Group-theoretic models of the inversion process in bacterial genomes
- scientific article; zbMATH DE number 7765413 (Why is no real title available?)
- Sorting permutations with transpositions in \(O(n^3)\) amortized time
- Invertibility of Digraphs and Tournaments
- Rearrangements in phylogenetic inference: compare, model, or encode?
- An algebraic model for inversion and deletion in bacterial genome rearrangement
- New applications of interval generators to genome comparison
- Sorting permutations and binary strings by length-weighted rearrangements
- A Hamilton cycle in the \(k\)-sided pancake network
- Statistical and Combinatorial Aspects of Comparative Genomics*
- The distance of rearrangement, the dual functional of Bowen
- Some relations on prefix reversal generators of the symmetric and hyperoctahedral group
- Flipping edge-labelled triangulations
- Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution
- scientific article; zbMATH DE number 1836437 (Why is no real title available?)
- Sorting by prefix block-interchanges
- Maximum likelihood estimates of pairwise rearrangement distances
- Aligning and Labeling Genomes under the Duplication-Loss Model
- Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals
- scientific article; zbMATH DE number 5539320 (Why is no real title available?)
- Greedy flipping of pancakes and burnt pancakes
- Models and algorithms for genome rearrangement with positional constraints
- Approximating the number of double cut-and-join scenarios
- Median approximations for genomes modeled as matrices
- Extremal permutations in routing cycles
- \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges
- An audit tool for genome rearrangement algorithms
- Sorting by Cuts, Joins and Whole Chromosome Duplications
- Counting and sampling SCJ small parsimony solutions
- On the role of metaheuristic optimization in bioinformatics
- Prefix and suffix reversals on strings
- Successor rules for flipping pancakes and burnt pancakes
- Maximum cycle packing in Eulerian graphs using local traces
- Sorting permutations: games, genomes, and cycles
- Sorting signed permutations by tandem duplication random loss and inverse tandem duplication random loss
- Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps
- Heuristics for reversal distance between genomes with duplicated genes
- A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation
- An efficient algorithm for one-sided block ordering problem under block-interchange distance
- Prefix and Suffix Reversals on Strings
- Length two path centered surface areas of the \((n, k)\)-star graph
- The `Butterfly effect' in Cayley graphs with applications to genomics.
- Rearrangement events on circular genomes
- An algebraic view of bacterial genome evolution
- Sorting by prefix reversals and prefix transpositions
- The \textsc{maximum zero-sum partition} problem
- Some integer values in the spectra of burnt pancake graphs
- Asymptotic medians of random permutations sampled from reversal random walks
- Comparative genomics on artificial life
- A small trip in the untranquil world of genomes: a survey on the detection and analysis of genome rearrangement breakpoints
- The floor is lava -- halving genomes with viaducts, piers and pontoons
- The evolution of the random reversal graph
- Bounding prefix transposition distance for strings and permutations
- On the hardness of maximum rank aggregation problems
- Complete edge-colored permutation graphs
- Reversal distance on genomes with different gene content and intergenic regions information
- Sorting genomes by prefix double-cut-and-joins
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets
- Longest increasing subsequences and log concavity
- Sorting by reversals and the theory of 4-regular graphs
- scientific article; zbMATH DE number 2185633 (Why is no real title available?)
- Complexity and enumeration in models of genome rearrangement
- Crossings and nestings for arc-coloured permutations and automation
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations
- Girth of pancake graphs
- The combinatorics of tandem duplication
- Sorting by \(k\)-cuts on signed permutations
- Combinatorics of chromosomal rearrangements based on synteny blocks and synteny packs
- Polynomial-time sortable stacks of burnt pancakes
- Exact and approximation algorithms for the contiguous translocation distance problem
- Distances in graphs of permutations
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
- Tighter upper bound for sorting permutations with prefix transpositions
- Approximation algorithms for sorting by length-weighted prefix and suffix operations
- On the computational complexity of closest genome problems
- Computing similarity distances between rankings
- The distribution of cycles in breakpoint graphs of signed permutations
- Sorting signed permutations by reversals using link-cut trees
- The parameterized complexity of local search for TSP, more refined
- Fixed-parameter algorithms for scaffold filling
- Permutation-constrained common string partitions with applications
- The Combinatorics of Sequencing the Corn Genome
- Sorting on graphs by adjacent swaps using permutation groups
- Uniquely pressable graphs: characterization, enumeration, and recognition
- Comparative Genomics
- Sorting genomes by prefix double-cut-and-joins
- Constant time and space updates for the sigma-tau problem
- Generating signed permutations by twisting two-sided ribbons
- scientific article; zbMATH DE number 5713387 (Why is no real title available?)
This page was built for publication: Combinatorics of genome rearrangements.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393448)
