PluribusFast is a more efficient implementation of the Pluribus algorithm.
PluribusFast is currently designed for Illumina style sequencing data only,
as it currently only corrects substitution type errors. See below for
the original Pluribus implementation.
Pluribus utilizes a suffix tree to identify and correct sequencing errors in next generation sequencing
data. Our tool takes advantage of the multiple manifestations of the sequencing error in the tree to
improve correction performance.