scientific article; zbMATH DE number 910919
From MaRDI portal
Publication:4886096
zbMath0846.92019MaRDI QIDQ4886096
Publication date: 22 August 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
inversionoptimal algorithmcombinatorial algorithmstranslocationgenome rearrangements2-approximation algorithmrearrangement distancetranslocation distance
Problems related to evolution (92D15) Biochemistry, molecular biology (92C40) Parallel algorithms in computer science (68W10)
Related Items (17)
On the complexity of unsigned translocation distance ⋮ Reconstructing an ancestral genome using minimum segments duplications and reversals. ⋮ Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics ⋮ Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) ⋮ Can a breakpoint graph be decomposed into none other than 2-cycles? ⋮ A 1.75-approximation algorithm for unsigned translocation distance ⋮ Sorting genomes by generalized translocations ⋮ A 1.375-approximation algorithm for unsigned translocation sorting ⋮ A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations ⋮ An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations ⋮ Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? ⋮ CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS ⋮ Sorting permutations by block-interchanges ⋮ Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) ⋮ Polynomial-time algorithm for computing translocation distance between genomes ⋮ On the complexity and approximation of syntenic distance ⋮ Reconstructing a history of recombinations from a set of sequences
This page was built for publication:
