scientific article; zbMATH DE number 1263193
From MaRDI portal
Publication:4234063
Recommendations
Cited in
(52)- An approximation algorithm for sorting by reversals and transpositions
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions
- On the complexity and approximation of syntenic distance
- Reconstructing a history of recombinations from a set of sequences
- Walking tree heuristics for comparative genomic alignments.
- Sorting by reversals and the theory of 4-regular graphs
- On the average number of reversals needed to sort signed permutations
- Sorting signed permutations by reversals, revisited
- (1+)-approximation of sorting by reversals and transpositions.
- Reconstructing an ancestral genome using minimum segments duplications and reversals.
- Steps toward accurate reconstructions of phylogenies from gene-order data.
- Genomic distances under deletions and insertions
- Exploiting pseudo-locality of interchange distance
- Genome rearrangements: a correct algorithm for optimal capping
- Estimate the distance of genome rearrangements by reversals
- Optimal algorithms for uncovering synteny problem
- The evolution of the random reversal graph
- An approximation algorithm for genome sorting by reversals to recover all adjacencies
- Short proofs for cut-and-paste sorting of permutations
- Reducibility of gene patterns in ciliates using the breakpoint graph.
- Can a breakpoint graph be decomposed into none other than 2-cycles?
- A 1.75-approximation algorithm for unsigned translocation distance
- Sorting by Cuts, Joins and Whole Chromosome Duplications
- Transforming cabbage into turnip
- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
- Simple Operations for Gene Assembly
- Finding All Sorting Tandem Duplication Random Loss Operations
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
- Can a breakpoint graph be decomposed into none other than 2-cycles?
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions
- scientific article; zbMATH DE number 871927 (Why is no real title available?)
- Genome Rearrangements and Sorting by Reversals
- Pancake flipping and sorting permutations
- Rearrangements in phylogenetic inference: compare, model, or encode?
- Comparing integer linear programming to SAT-solving for hard problems in computational and systems biology
- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
- Combinatorial Pattern Matching
- Finding all sorting tandem duplication random loss operations
- An algorithm for reversal median problem
- Sorting circular permutations by reversal.
- Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
- Polynomial-time algorithm for computing translocation distance between genomes
- Sorting with fixed-length reversals
- Constant time and space updates for the sigma-tau problem
- Generating signed permutations by twisting two-sided ribbons
- A textbook solution for dynamic strings
- An exact and fast SAT formulation for the DCJ distance
- A textbook solution for dynamic strings
- A bound for the reversal distance of genome rearrangements
- Patterns of simple gene assembly in ciliates
- Decision problem for shuffled genes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234063)
