Computing the rearrangement distance of natural genomes

The computation of genomic distances has been a very active field of computational comparative genomics over the last 25 years. Substantial results include the polynomial-time computability of the inversion distance by Hannenhalli and Pevzner in 1995 and the introduction of the double-cut and join (DCJ) distance by Yancopoulos et al. in 2005. Both results, however, rely on the assumption that the genomes under comparison contain the same set of unique markers (syntenic genomic regions, sometimes also referred to as genes). In 2015, Shao, Lin and Moret relax this condition by allowing for duplicate markers in the analysis. This generalized version of the genomic distance problem is NP-hard, and they give an ILP solution that is efficient enough to be applied to real-world datasets. A restriction of their approach is that it can be applied only to balanced genomes, that have equal numbers of duplicates of any marker. Therefore it still needs a delicate preprocessing of the input data in which excessive copies of unbalanced markers have to be removed. In this paper we present an algorithm solving the genomic distance problem for natural genomes, in which any marker may occur an arbitrary number of times. Our method is based on a new graph data structure, the multi-relational diagram, that allows an elegant extension of the ILP by Shao, Lin and Moret to count runs of markers that are under- or over-represented in one genome with respect to the other and need to be inserted or deleted, respectively. With this extension, previous restrictions on the genome configurations are lifted, for the first time enabling an uncompromising rearrangement analysis. Any marker sequence can directly be used for the distance calculation. The evaluation of our approach shows that it can be used to analyze genomes with up to a few ten thousand markers, which we demonstrate on simulated and real data.

[1]  David Sankoff,et al.  Edit Distances for Genome Comparisons Based on Non-Local Operations , 1992, CPM.

[2]  Pavel A. Pevzner,et al.  Transforming men into mice (polynomial algorithm for genomic distance problem) , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[3]  P. Pevzner.  Transforming Men into Mice , 1996 .

[4]  David Sankoff,et al.  Genome rearrangement with gene families , 1999, Bioinform..

[5]  Pavel A. Pevzner,et al.  Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals , 1999, J. ACM.

[6]  D. Bryant.  The Complexity of Calculating Exemplar Distances , 2000 .

[7]  Richard Friedberg,et al.  Efficient sorting of genomic permutations by translocation, inversion and block interchange , 2005, Bioinform..

[8]  D. Huson,et al.  Application of phylogenetic networks in evolutionary studies. , 2006, Molecular biology and evolution.

[9]  Jens Stoye,et al.  A Unifying View of Genome Rearrangements , 2006, WABI.

[10]  Richard Friedberg,et al.  Genome rearrangement by the double cut and join operation. , 2008, Methods in molecular biology.

[11]  Jonathan M. Keith,et al.  Bioinformatics: Volume I: Data, Sequence Analysis, and Evolution , 2008 .

[12]  On the Approximability of Comparing Genomes with Duplicates , 2009, J. Graph Algorithms Appl..

[13]  Richard Friedberg,et al.  DCJ Path Formulation for Genome Transformations which Include Insertions, Deletions, and Duplications , 2009, J. Comput. Biol..

[14]  Jens Stoye,et al.  The Solution Space of Sorting by DCJ , 2010, J. Comput. Biol..

[15]  Jens Stoye,et al.  Double Cut and Join with Insertions and Deletions , 2011, J. Comput. Biol..

[16]  Phillip E. C. Compeau.  DCJ-Indel sorting revisited , 2012, Algorithms for Molecular Biology.

[17]  Marília D. V. Braga,et al.  An Overview of Genomic Distances Modeled with Indels , 2013, CiE.

[18]  Laurent Bulteau,et al.  Inapproximability of (1,2)-Exemplar Distance , 2013, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[19]  Tomás Vinar,et al.  DNA Sequence Segmentation Based on Local Similarity , 2013, ITAT.

[20]  Jens Stoye,et al.  On the family-free DCJ distance and similarity , 2015, Algorithms for Molecular Biology.

[21]  Bernard M. E. Moret,et al.  An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes , 2015, J. Comput. Biol..

[22]  David A. Bader,et al.  Exemplar or matching: modeling DCJ problems with unequal content genome data , 2015, Journal of Combinatorial Optimization.

[23]  Ryan L. Collins,et al.  Multi-platform discovery of haplotype-resolved structural variation in human genomes , 2017, bioRxiv.

[24]  Vassily A. Lyubetsky,et al.  Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming , 2017, BMC Bioinformatics.

[25]  Li Ding,et al.  Multi-platform discovery of haplotype-resolved structural variation in human genomes , 2018, Nature Communications.

[26]  Sudhir Kumar,et al.  MEGA X: Molecular Evolutionary Genetics Analysis across Computing Platforms. , 2018, Molecular biology and evolution.

[27]  Andreas Willfahrt,et al.  Polymer gels with tunable ionic Seebeck coefficient for ultra-sensitive printed thermopiles , 2019, Nature Communications.

[28]  David Dylus,et al.  OMA standalone: orthology inference among public and custom genomes and transcriptomes. , 2019, Genome research.

[29]  Daniel Doerr,et al.  Analysis of local genome rearrangement improves resolution of ancestral genomic maps in plants , 2020, BMC Genomics.

[30]  Diego P. Rubert,et al.  Natural family-free genomic distance , 2020, Algorithms for Molecular Biology.

[31]  Daniel Doerr,et al.  Computing the Rearrangement Distance of Natural Genomes , 2021, J. Comput. Biol..