LoRMA: a self correction program for long reads


Overview

LoRMA is an error correction program for long reads, which are sequences obtained using the third generation of sequencing technologies (3GS), either with Oxford Nanopore technology or with Pacific Biosciences technology.

LoRMA is a so-called self-correction software, as opposed to e.g. LoRDEC that is a hybrid error correction tool. This means that LoRMA uses only long read sequencing data and thus does not require short read data.

LoRMA proceeds in two phases.

  1. It iteratively performs local correction of the long reads using LoRDEC (with one special option). The number of LoRDEC iterations is set by the user.
  2. It then corrects the long read using long-range sequence similarity, which it detects by clustering similar reads using a heuristic multiple alignment procedure.

Figure 1: LoRMA process overview. (top) conceptual process. (bottom) pipeline. It uses LoRDEC with a special parameter for self-correction. The entire pipeline can be executed with a single script lorma.sh.

In the first phase, LoRDEC is run with an increasing parameter \(k\), which defines the \(k\) -mers used in the de Bruijn graph. By default, one performs three runs of LoRDEC correction typically with the k-mer sizes 19, 40 and 61 for a yeast data set.
The more iterations, the better the correction, the longer the execution time.

In the second phase, LoRMA process each read in turn. It searches for other reads that share similar regions with the current read. These similar reads are termed friends. An option controls how many friends are sought. It computes a multiple alignment of this subset of reads and uses the consensus sequence to correct the current read.

On this site, we provide the program, easy installation procedures (as a linux package or as a conda package), as well as script for parallel execution on large computing servers.

Publication

Funding

  • Current support for maintenance and development of LoRMA: ATGC and IFB
  • Supports from Finland for the original research and development of LoRMA: University of Helsinki, SYSCOL project, Helsinki Institute for Information Technology
  • Supports from France for the original research and development of LoRMA: LIRMM and Institute of Computational Biology.

PEWO: a collection of workflows to benchmark phylogenetic placement

PEWO: a collection of workflows…

Introduction and context In the Bioinformatics team of the LIRMM (CNRS & Univ. Montpellier), we develop a series of tools for metagenomics / metabarcoding analysis. Our tools exploit phylo-k-mers (which are k-mers combined with phylogenetic information) computed for an input set of reference sequences and their phylogeny. The phylo-k-mers are computed and indexed with IPK,…

Biodiversity Bioinformatics Evolutionary biology Molecular evolution Taxonomic classification Genome accession RNA sequence FASTA FASTQ newick
EPIK: Precise and scalable evolutionary placement with informative k-mers

EPIK: Precise and scalable evolutionary…

EPIK is a program dedicated to « Phylogenetic Placement » (PP) of metagenomic or metabarcoding reads on a reference tree. It is similar in spirit and technically the successor of RAPPAS (Linard et al. 2020). EPIK achieves identical or slightly better accuracy than RAPPAS and outperforms it in speed and flexibility. In many aspects the documentation of RAPPAS…

MYST

MYST

What is MYST? MYST is the orchestration platform behind ATGC online bioinformatics services. It provides a unified web interface and a public REST API to submit analyses, monitor jobs, and retrieve results across a growing catalog of phylogenetic and sequence-analysis tools. TIDE is a modernized redesign of WAVES, an older tool previously developped by ATGC…

Sequence analysis Software engineering Service discovery Service invocation Service management Job identifier Tool metadata HTML JSON
⚠️ Online tool executions will be unavailable on June 16, 2026, from 9:00 AM due to scheduled cluster maintenance. ⚠️ This website is under construction, some information or links could be unavailable ⚠️