CoreCruncher: Fast and Robust Construction of Core Genomes in Large Prokaryotic Data Sets

• Published in: Molecular biology and evolution 2021-02, Vol.38 (2), p.727-734
• Main Authors: Harris, Connor D, Torrance, Ellis L, Raymann, Kasie, Bobay, Louis-Marie
• Format: Article
• Language: English
• Subjects: Analysis; BASIC BIOLOGICAL SCIENCES; core genome; Genes; Genetic research; Genomes; Genomics; MATHEMATICS AND COMPUTING; orthology; prokaryotes; Resources
• ISSN: 1537-1719; 0737-4038; 1537-1719
• DOI: 10.1093/molbev/msaa224

Abstract The core genome represents the set of genes shared by all, or nearly all, strains of a given population or species of prokaryotes. Inferring the core genome is integral to many genomic analyses, however, most methods rely on the comparison of all the pairs of genomes; a step that is becoming increasingly difficult given the massive accumulation of genomic data. Here, we present CoreCruncher; a program that robustly and rapidly constructs core genomes across hundreds or thousands of genomes. CoreCruncher does not compute all pairwise genome comparisons and uses a heuristic based on the distributions of identity scores to classify sequences as orthologs or paralogs/xenologs. Although it is much faster than current methods, our results indicate that our approach is more conservative than other tools and less sensitive to the presence of paralogs and xenologs. CoreCruncher is freely available from: https://github.com/lbobay/CoreCruncher. CoreCruncher is written in Python 3.7 and can also run on Python 2.7 without modification. It requires the python library Numpy and either Usearch or Blast. Certain options require the programs muscle or mafft.