scientific article; zbMATH DE number 1786450
From MaRDI portal
Publication:4547739
zbMath0990.68050MaRDI QIDQ4547739
Publication date: 21 August 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2089/20890106
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Reconstructing an ancestral genome using minimum segments duplications and reversals. ⋮ Aligning and Labeling Genomes under the Duplication-Loss Model ⋮ HP Distance Via Double Cut and Join Distance ⋮ Improved bounds on sorting by length-weighted reversals ⋮ Comparing bacterial genomes from linear orders of patterns ⋮ Uniquely pressable graphs: characterization, enumeration, and recognition ⋮ On maximal instances for the original syntenic distance ⋮ A simpler and faster 1.5-approximation algorithm for sorting by transpositions ⋮ Sorting signed permutations by reversals, revisited ⋮ Reversal and transposition medians ⋮ A new linear time algorithm to compute the genomic distance via the double cut and join distance ⋮ A new characterization of \(\mathcal{V} \)-posets ⋮ General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic ⋮ \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions.