scientific article; zbMATH DE number 1303563
From MaRDI portal
Publication:4250188
zbMath0930.68044MaRDI QIDQ4250188
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
A topological framework for signed permutations ⋮ On sorting unsigned permutations by double-cut-and-joins ⋮ Can a breakpoint graph be decomposed into none other than 2-cycles? ⋮ Structural properties and tractability results for linear synteny ⋮ An approximation algorithm for genome sorting by reversals to recover all adjacencies ⋮ Sorting by prefix reversals and prefix transpositions ⋮ Approximating Shortest Connected Graph Transformation for Trees ⋮ Some problems on Cayley graphs ⋮ A 14/11-approximation algorithm for sorting by short block-moves ⋮ A simpler and faster 1.5-approximation algorithm for sorting by transpositions ⋮ On sorting by 3-bounded transpositions ⋮ A sparse dynamic programming algorithm for alignment with non-overlapping inversions ⋮ An approximation algorithm for sorting by reversals and transpositions ⋮ An improved genetic algorithm for problem of genome rearrangement ⋮ A Retrospective on Genomic Preprocessing for Comparative Genomics
This page was built for publication:
