Pages that link to "Item:Q1902472"
From MaRDI portal
The following pages link to Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement (Q1902472):
Displayed 48 items.
- Topological morphing of planar graphs (Q386891) (← links)
- Quotient geometric crossovers and redundant encodings (Q418019) (← links)
- Pancake flipping and sorting permutations (Q491630) (← links)
- Girth of pancake graphs (Q642997) (← links)
- Sorting permutations by block-interchanges (Q673336) (← links)
- The `Butterfly effect' in Cayley graphs with applications to genomics. (Q694707) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- Structural properties and tractability results for linear synteny (Q876715) (← links)
- Some problems on Cayley graphs (Q952069) (← links)
- An approximation algorithm for sorting by reversals and transpositions (Q1018097) (← links)
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions (Q1274604) (← links)
- On the complexity and approximation of syntenic distance (Q1281760) (← links)
- Sorting by bounded block-moves (Q1281770) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- A new approximation algorithm for sorting of signed permutations (Q1400064) (← links)
- Flipping edge-labelled triangulations (Q1699301) (← links)
- Sorting permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)
- Maximum likelihood estimates of rearrangement distance: implementing a representation-theoretic approach (Q1736946) (← links)
- Efficient algorithms for multichromosomal genome rearrangements. (Q1872727) (← links)
- Sorting a permutation by best short swaps (Q2037101) (← links)
- Entropic fluctuations in DNA sequences (Q2148393) (← links)
- Maximum cycle packing in Eulerian graphs using local traces (Q2259574) (← links)
- A topological framework for signed permutations (Q2359959) (← links)
- The spectral gap of graphs arising from substring reversals (Q2363694) (← links)
- On sorting unsigned permutations by double-cut-and-joins (Q2377380) (← links)
- Estimate the distance of genome rearrangements by reversals (Q2385374) (← links)
- Optimal algorithms for uncovering synteny problem (Q2385477) (← links)
- Reconstruction of permutations distorted by reversal errors (Q2462381) (← links)
- On sorting by 3-bounded transpositions (Q2497524) (← links)
- An Audit Tool for Genome Rearrangement Algorithms (Q2828184) (← links)
- Two-sided Group Digraphs and Graphs (Q3188663) (← links)
- Approximating Shortest Connected Graph Transformation for Trees (Q3297756) (← links)
- On Sorting by 3-Bounded Transpositions (Q3439056) (← links)
- Edit Distances and Factorisations of Even Permutations (Q3541123) (← links)
- A DISCRIMINATION MEASURE FOR PHYLOGENETIC TREE CONSTRUCTION (Q3608705) (← links)
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions (Q4680734) (← links)
- Kernelization of Whitney Switches (Q4997132) (← links)
- A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions (Q5041121) (← links)
- Heuristics for Reversal Distance Between Genomes with Duplicated Genes (Q5041123) (← links)
- (Q5140777) (← links)
- Packing Euler graphs with traces (Q5176280) (← links)
- Bacterial phylogeny in the Cayley graph (Q5242833) (← links)
- APPROXIMATE BLOCK SORTING (Q5291300) (← links)
- An improved genetic algorithm for problem of genome rearrangement (Q5492501) (← links)
- Kernelization of Whitney Switches (Q5874518) (← links)
- Signed genome rearrangement by reversals and transpositions: Models and approximations (Q5941291) (← links)
- Polynomial-time algorithm for computing translocation distance between genomes (Q5961622) (← links)
- Quantum routing in planar graph using perfect state transfer (Q6089494) (← links)