scientific article; zbMATH DE number 1306890
From MaRDI portal
Publication:4252743
zbMath0938.68939MaRDI QIDQ4252743
Pavel A. Pevzner, Sridhar Hannenhalli
Publication date: 26 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (36)
Reconstructing an ancestral genome using minimum segments duplications and reversals. ⋮ Efficient algorithms for multichromosomal genome rearrangements. ⋮ A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions ⋮ Computing the Rearrangement Distance of Natural Genomes ⋮ Tandem Duplications, Segmental Duplications and Deletions, and Their Applications ⋮ Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics ⋮ Genome rearrangements: a correct algorithm for optimal capping ⋮ Comparative Genomics on Artificial Life ⋮ A new approach for the reversal distance with indels and moves in intergenic regions ⋮ Balanced vertices in trees and a simpler algorithm to compute the genomic distance ⋮ Sorting genomes by generalized translocations ⋮ Algebraic double cut and join: A group-theoretic approach to the operator on multichromosomal genomes ⋮ On the class of double distance problems ⋮ HP Distance Via Double Cut and Join Distance ⋮ An efficient algorithm for one-sided block ordering problem under block-interchange distance ⋮ Genome Halving under DCJ Revisited ⋮ An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations ⋮ Multi-break rearrangements and chromosomal evolution ⋮ Linear algorithm for a cyclic graph transformation ⋮ Analysis of top-swap shuffling for genome rearrangements ⋮ Linear algorithm for minimal rearrangement of structures ⋮ Genome rearrangements with partially ordered chromosomes ⋮ An improved algorithm for sorting by block-interchanges based on permutation groups ⋮ Group-theoretic models of the inversion process in bacterial genomes ⋮ Polynomial-time algorithm for computing translocation distance between genomes ⋮ Reversals distance considering flexible intergenic regions sizes ⋮ An Audit Tool for Genome Rearrangement Algorithms ⋮ Reconstructing a history of recombinations from a set of sequences ⋮ A new linear time algorithm to compute the genomic distance via the double cut and join distance ⋮ The Genesis of the DCJ Formula ⋮ Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? ⋮ The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances ⋮ Efficient algorithms for approximate string matching with swaps ⋮ A probabilistic algorithm for updating files over a communication link ⋮ Bacterial phylogeny in the Cayley graph ⋮ Computing the Tandem Duplication Distance is NP-Hard
This page was built for publication:
