scientific article; zbMATH DE number 910920
zbMATH Open0846.92007MaRDI QIDQ4886097FDOQ4886097
Authors: Vineet Bafna, Pavel Pevzner 
Publication date: 30 September 1996
Title of this publication is not available (Why is that?)
Recommendations
permutationsapproximation algorithmssymmetric groupsequence alignmentgenome comparisongenome rearrangementssorting by transpositionsalignment algorithmsgene comparisonlower bounds on transposition distance
Permutations, words, matrices (05A05) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Combinatorics in computer science (68R05) Searching and sorting (68P10)
Cited In (28)
- Steps toward accurate reconstructions of phylogenies from gene-order data.
- Polynomial-time algorithm for computing translocation distance between genomes
- Title not available (Why is that?)
- The complexity of genome rearrangement combinatorics under the infinite sites model
- Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
- An algorithm for reversal median problem
- Sorting of Permutations by Cost-Constrained Transpositions
- Sorting permutations by block-interchanges
- On the complexity and approximation of syntenic distance
- STEINER POINTS IN THE SPACE OF GENOME REARRANGEMENTS
- Finding all sorting tandem duplication random loss operations
- Sorting signed permutations by tandem duplication random loss and inverse tandem duplication random loss
- Interchanging graphs associated with sorting by transpositions
- Reconstructing a history of recombinations from a set of sequences
- Two permutation classes related to the bubble sort operator
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions
- Estimate the distance of genome rearrangements by reversals
- Sorting by prefix reversals and prefix transpositions
- A simpler 1.5-approximation algorithm for sorting by transpositions
- Sorting by transpositions is difficult
- Reversal distance on genomes with different gene content and intergenic regions information
- Sorting with fixed-length reversals
- Distances in graphs of permutations
- Sorting strings by reversals and by transpositions
- On sorting by 3-bounded transpositions
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations
- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
- Bacterial phylogeny in the Cayley graph
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 Q4886097)
