Skip to content
BUSCOMP: BUSCO Compiler and Comparison tool
HTML Python
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.

BUSCOMP: BUSCO Compiler and Comparison tool

BUSCOMP is designed to overcome some of the non-deterministic limitations of BUSCO to:

  1. compile a non-redundant maximal set of complete BUSCOs from a set of assemblies, and
  2. use this set to provide a "true" comparison of completeness between different assemblies of the same genome with predictable behaviour.

Full documentation is available in the file included in this repository. For a better rendering and navigation of this document, please download and open ./docs/ This documentation can also be generated by running BUSCOMP with the dochtml=T option. (R and pandoc must be installed - see docs.)

For a quick start guide with example data, see You will need Minimap2 installed. Example BUSCO runs are provided, but for real life use you will also want to install BUSCO.

If you just want to look at example output, please see the ./example/run/yeast.N3L20ID0U.html and ./example/run/yeast.N3L20ID0U.full.html. (Results for a full example run are available in the ./example/run/ directory.)


BUSCOMP is not yet published, but the paper is in preparation. If you want to use BUSCOMP in a publication in the meantime, please cite the GSA2019 presentation on F1000Research:

  • Edwards RJ (2019): BUSCOMP: BUSCO compilation and comparison – Assessing completeness in multiple genome assemblies [version 1; not peer reviewed]. F1000Research 8:995 (slides) (doi: 10.7490/f1000research.1116972.1)

© 2019 Richard Edwards |

You can’t perform that action at this time.