scientific article; zbMATH DE number 910920
From MaRDI portal
Publication:4886097
zbMath0846.92007MaRDI QIDQ4886097
Vineet Bafna, Pavel A. Pevzner
Publication date: 30 September 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
permutationssymmetric groupapproximation algorithmssequence alignmentgenome comparisongenome rearrangementssorting by transpositionsalignment algorithmsgene comparisonlower bounds on transposition distance
Searching and sorting (68P10) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)
Related Items (17)
Steps toward accurate reconstructions of phylogenies from gene-order data. ⋮ The complexity of genome rearrangement combinatorics under the infinite sites model ⋮ Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) ⋮ Estimate the distance of genome rearrangements by reversals ⋮ Sorting permutations by block-interchanges ⋮ Sorting by Transpositions Is Difficult ⋮ Finding all sorting tandem duplication random loss operations ⋮ An algorithm for reversal median problem ⋮ Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) ⋮ Polynomial-time algorithm for computing translocation distance between genomes ⋮ Sorting with fixed-length reversals ⋮ Plane Permutations and Applications to a Result of Zagier--Stanley and Distances of Permutations ⋮ Reversal distance on genomes with different gene content and intergenic regions information ⋮ 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 ⋮ Bacterial phylogeny in the Cayley graph
This page was built for publication:
