A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal Contents

No abstract is available for this paper.

• Publication year

  2014

• Venue

  International Computing and Combinatorics Conference

• Publication date

  2014-08-04

• Fields of study

  Biology, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-08783-2_20
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Correlation bounds and #SAT algorithms for small linear-size circuits

  2015cited by this paper
• An Exact Algorithm to Compute the DCJ Distance for Genomes with Duplicate Genes

  2014cited by this paper
• International Conference on Computational Science , ICCS 2013 Streaming Breakpoint Graph Analytics for Accelerating and Parallelizing the Computation of DCJ Median of Three Genomes

  2013cited by this paper
• Ancestral Genome Inference Using a Genetic Algorithm Approach

  2013cited by this paper
• Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion

  2012cited by this paper
• Maximum Likelihood Phylogenetic Reconstruction from High-Resolution Whole-Genome Data and a Tree of 68 Eukaryotes

  2012cited by this paper
• Erratum: The Approximability of the Exemplar Breakpoint Distance Problem

  2012cited by this paper
• A Simplified View of DCJ-Indel Distance

  2012cited by this paper
• GASTS: Parsimony Scoring under Rearrangements

  2011cited by this paper
• The Median Problems on Linear Multichromosomal Genomes: Graph Representation and Fast Exact Solutions

  2010influential reference
• Heuristics for the inversion median problem

  2010cited by this paper
• Enhanced CellClassifier: a multi-class classification tool for microscopy images

  2010cited by this paper
• Genomic Distance with DCJ and Indels

  2010cited by this paper
• Combinatorics of Genome Rearrangements

  2009cited by this paper
• A Fast and Exact Algorithm for the Median of Three Problem: A Graph Decomposition Approach

  2008influential reference
• Sorting Genomes with Insertions, Deletions and Duplications by DCJ

  2008influential reference
• Approximating the true evolutionary distance between two genomes

  2008cited by this paper
• Reactive Stochastic Local Search Algorithms for the Genomic Median Problem

  2008cited by this paper
• Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem

  2008influential reference
• Evolutionary Computation in Combinatorial Optimization

  2006cited by this paper
• Genomes Containing Duplicates Are Hard to Compare

  2006cited by this paper
• Divide-and-conquer approach for the exemplar breakpoint distance

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

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

  2005cited by this paper
• Efficient sorting of genomic permutations by translocation, inversion and block interchange

  2005cited by this paper
• On Sorting by Translocations

  2005cited by this paper
• Algorithms and Data Structures

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

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

  2003cited by this paper
• The Reversal Median Problem

  2003cited by this paper
• Steps toward accurate reconstructions of phylogenies from gene-order data

  2002cited by this paper
• Algorithms in Bioinformatics

  2002cited by this paper
• Genome-scale evolution: reconstructing gene orders in the ancestral species.

  2002cited by this paper
• New approaches for reconstructing phylogenies from gene order data

  2001influential reference
• A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study

  2001cited by this paper
• Computational Molecular Biology: An Algorithmic Approach

  2001cited by this paper
• Computational molecular biology : an algorithmic approach

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

  2000cited by this paper
• Genome rearrangement with gene families

  1999cited by this paper
• The median problems for breakpoints are NP-complete

  1998cited by this paper
• Polynomial-time Algorithm for Computing Translocation Distance Between Genomes

  1995cited by 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 unknowncited by this paper

• Gene family-free genome comparison

  2016cites this paper