Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes

No abstract is available for this paper.

• Publication year

  2008

• Venue

  J. Comput. Biol.

• Publication date

  2008-09-22

• Fields of study

  Biology, Medicine, Computer Science

• Identifiers
  DOI 10.1089/cmb.2008.0061PMID 18774903
• 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.

• On the Approximability of Comparing Genomes with Duplicates

  2008cited by this paper
• A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes

  2007influential reference
• Comparing Genomes with Duplications: A Computational Complexity Point of View

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

  2007cited by this paper
• A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates

  2007influential reference
• A General Framework for Computing Rearrangement Distances between Genomes with Duplicates

  2007influential reference
• Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes

  2006cited by this paper
• The Approximability of the Exemplar Breakpoint Distance Problem

  2006cited by this paper
• Maximizing Synteny Blocks to Identify Ancestral Homologs

  2005cited by this paper
• Genes Order and Phylogenetic Reconstruction: Application to (cid:13) -Proteobacteria

  2005cited by this paper
• Assignment of orthologous genes via genome rearrangement

  2005cited by this paper
• Conserved Interval Distance Computation Between Non-trivial Genomes

  2005cited by this paper
• The breakpoint distance for signed sequences

  2005cited by this paper
• Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria

  2005influential reference
• Power Boosts for Cluster Tests

  2005cited by this paper
• Evolutionary Origins of Genomic Repertoires in Bacteria

  2005cited by this paper
• Genomic Distances under Deletions and Insertions

  2003cited by this paper
• On the Similarity of Sets of Permutations and Its Applications to Genome Comparison

  2003cited by this paper
• From Gene Trees to Organismal Phylogeny in Prokaryotes:The Case of the γ-Proteobacteria

  2003cited by this paper
• Comparative Genomics: "Empirical And Analytical Approaches To Gene Order Dynamics, Map Alignment And The Evolution Of Gene Families"

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

  2000cited by this paper
• Genome rearrangement with gene families

  1999cited by this paper
• Fast Algorithms to Enumerate All Common Intervals of Two Permutations

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

  1995cited by this paper
• Theory of linear and integer programming

  1986cited by this paper
• The chromosome inversion problem

  1982cited by this paper

• An Integer Linear Programming Approach for Scaffolding Based on Exemplar Breakpoint Distance

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

  2019cites this paper
• Computing the family-free DCJ similarity

  2018cites this paper
• Approximating the DCJ distance of balanced genomes in linear time

  2017cites this paper
• Algorithms for Computing the Family-Free Genomic Similarity Under DCJ

  2017cites this paper
• A Tractable Variant of the Single Cut or Join Distance with Duplicated Genes

  2017cites this paper
• New Genome Similarity Measures based on Conserved Gene Adjacencies

  2017cites this paper
• A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates

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

  2016cites this paper
• Gene family-free genome comparison

  2016influential citation
• New Genome Similarity Measures Based on Conserved Gene Adjacencies

  2016influential citation
• A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

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

  2015cites this paper
• A parameterized algorithm for (1,2)-exemplar breakpoint distance

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

  2013cites this paper
• The Potential of Family-Free Genome Comparison

  2013cites this paper
• Duplication, Rearrangement and Reconciliation: A Follow-Up 13 Years Later

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

  2013cites this paper
• Gene family assignment-free comparative genomics

  2012influential citation
• Computing Genomic Distances: An Algorihtmic Viewpoint

  2011cites this paper
• Algorithmic Contributions to Computational Molecular Biology

  2010influential citation
• Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes

  2010influential citation
• Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems

  2009cites this paper
• Pseudo Boolean Programming for Partially Ordered Genomes

  2009cites this paper
• Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes Using Pseudo-Boolean Optimization

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

  2009influential citation
• On the Approximability of Comparing Genomes with Duplicates

  2008cites this paper
• Journal of Graph Algorithms and Applications on the Approximability of Comparing Genomes with Duplicates 20 Angibaud Et Al. Approximability of Comparing Genomes with Duplicates

  year unknowncites this paper