Skip to content

Moni

Description

moni website

MONI index uses the prefix-free parsing of the text [2][3] to build the Burrows-Wheeler Transform (BWT) of the reference genomes, the suffix array (SA) samples at the beginning and at the end of each run of the BWT, and the threshold positions of [1].

Environment Modules

Run module spider moni to find out what environment modules are available for this application.

Environment Variables

  • HPC_MONI_DIR - installation directory
  • HPC_MONI_BIN - executable directory

Citation

If you publish research that uses Moni you have to cite it as follows:

  • Bannai, H., Gagie, T., & I, T. (2020). Refining the r-index. Theoretical Computer Science, 812, 96–108. https://doi.org/10.1016/j.tcs.2019.04.006

  • Boucher, C., Gagie, T., Kuhnle, A., & Manzini, G. (2018). Prefix-free parsing for building big BWTs. In Proceedings of the 18th International Workshop on Algorithms in Bioinformatics (WABI 2018) (pp. 1–13). Schloss Dagstuhl–Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.WABI.2018.2

  • Boucher, C., Gagie, T., Kuhnle, A., Langmead, B., Manzini, G., & Mun, T. (2019). Prefix-free parsing for building big BWTs. Algorithms for Molecular Biology, 14(1), 13. https://doi.org/10.1186/s13015-019-0151-0

Categories

genomics, biology