Divide-and-conquer approach for the exemplar breakpoint distance

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Bioinform.

• Publication date

  2005-05-15

• Fields of study

  Biology, Medicine, Computer Science

• Identifiers
  DOI 10.1093/bioinformatics/bti327PMID 15713729
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar, PubMed

• No claims are published for this paper.

• No concepts are published for this paper.

• Reconstructing phylogenies from gene-content and gene-order data

  2007cited by this paper
• Computing the Assignment of Orthologous Genes via Genome Rearrangement

  2005cited by this paper
• Reversing Gene Erosion - Reconstructing Ancestral Bacterial Genomes from Gene-Content and Order Data

  2004cited by this paper
• Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content

  2003cited by this paper
• Initial sequencing and comparative analysis of the mouse genome.

  2002cited by this paper
• Initial sequencing and comparative analysis of the mouse genome

  2002cited by this paper
• Genomic sorting with length-weighted reversals.

  2002cited by this paper
• Duplication, Rearrangement, and Reconciliation

  2000cited by this paper
• The Complexity of Calculating Exemplar Distances

  2000influential reference
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

  1999cited by this paper
• Genome rearrangement with gene families

  1999influential reference
• Multiple Genome Rearrangement and Breakpoint Phylogeny

  1998cited by this paper
• Faster and simpler algorithm for sorting signed permutations by reversals

  1997cited by this paper
• Sorting by reversals is difficult

  1997cited by this paper
• Original Synteny

  1996cited by this paper
• Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

  1995cited by this paper
• Transforming men into mice (polynomial algorithm for genomic distance problem)

  1995influential reference
• Efficient Bounds for Oriented Chromosome Inversion Distance

  1994cited by this paper
• Lengths of chromosomal segments conserved since divergence of man and mouse.

  1984cited by this paper
• The chromosome inversion problem

  1982cited by this paper

• Longest Order Conserved Repetition-free Subsequences

  2023cites this paper
• Investigation of data mining technique and artificial intelligence algorithm in microflora bioinformatics

  2021cites this paper
• Approaching the One-Sided Exemplar Adjacency Number Problem

  2020cites this paper
• Longest Order Conserved Exemplar Subsequences

  2020cites this paper
• Genome Rearrangement Problems with Single and Multiple Gene Copies: A Review

  2019cites this paper
• On Approaching the One-Sided Exemplar Adjacency Number Problem

  2018cites this paper
• The Longest Common Exemplar Subsequence Problem

  2018cites this paper
• Predicting chemotherapeutic drug combinations through gene network profiling

  2016cites this paper
• On Computing Breakpoint Distances for Genomes with Duplicate Genes

  2016cites this paper
• A Dynamic Programming Algorithm For (1,2)-Exemplar Breakpoint Distance

  2015cites this paper
• Exemplar or matching: modeling DCJ problems with unequal content genome data

  2015cites this paper
• A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

  2015cites this paper
• Computing and Combinatorics

  2014influential citation
• A parameterized algorithm for (1,2)-exemplar breakpoint distance

  2014influential citation
• A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal Contents

  2014cites this paper
• On the approximability of the exemplar adjacency number problem for genomes with gene repetitions

  2014cites this paper
• A Retrospective on Genomic Preprocessing for Comparative Genomics

  2013cites this paper
• A Dynamic Programming Algorithm for Unsigned (1,2)-Exemplar Breakpoint Distance Problem with Span Constraint

  2013cites this paper
• An Exact Algorithm for the Zero Exemplar Breakpoint Distance Problem

  2013cites this paper
• Erratum: The Approximability of the Exemplar Breakpoint Distance Problem

  2012cites this paper
• Combinatorial Objects in Bio-algorithmics : Related Problems and Complexities Remerciements Rna Structure Comparison: Arc-annotated Sequences 1.1 Introduction 1.2 Preliminaries 1.2.1 Arc-annotated Sequences 1.2.2 Hierarchy

  2012cites this paper
• Combinatorial Objects in Bio-Algorithmics: Related problems and complexities

  2012cites this paper
• Positional orthology: putting genomic evolutionary relationships into context

  2011cites this paper
• A Polynomial Algebra Method for Computing Exemplar Breakpoint Distance

  2011cites this paper
• Aspects algorithmiques de la comparaison d'éléments biologiques. (Algorithmics aspects of biological entities comparison)

  2011cites this paper
• Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems

  2009cites this paper
• Aspects algorithmiques des réarrangements génomiques : duplications et ordres partiels. (Algorithmic Aspects of Genome Rearrangements: Duplications and Partial Orders)

  2009cites this paper
• The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated

  2009cites this paper
• Computational problems in genome rearrangements: from evolution to cancer

  2009cites this paper
• On the inapproximability of the exemplar conserved interval distance problem of genomes

  2008influential citation
• Robust and Efficient Algorithms for Protein 3-D Structure Alignment and Genome Sequence Comparison

  2008cites this paper
• Comparing Genomes with Duplications: A Computational Complexity Point of View

  2007cites this paper
• Transactions on Computational Biology and Bioinformatics 1 Comparing Genomes with Duplications: a Computational Complexity Point of View

  2007cites this paper
• Non-breaking Similarity of Genomes with Gene Repetitions

  2007cites this paper
• Computing the Reversal Distance between genomes in the Presence of Multi-gene Families via Binary Integer Programming

  2007cites this paper
• Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes

  2006influential citation
• The Approximability of the Exemplar Breakpoint Distance Problem

  2006influential citation
• Models and Methods in Comparative Genomics

  2006cites this paper
• Heuristic Algorithm for Computing Reversal Distance with MultiGene Families via Binary Integer Programming

  2005cites this paper
• Reversals of Fortune

  2005cites this paper
• A Framework for Orthology Assignment from Gene Rearrangement Data

  2005cites this paper
• Maximizing Synteny Blocks to Identify Ancestral Homologs

  2005cites this paper
• Transactions on Computational Biology and Bioinformatics 1 Comparing Genomes with Duplications: a Computational Complexity Point of View

  year unknowncites this paper