Skip to main content
. 2011 Jun 23;27(16):2194–2200. doi: 10.1093/bioinformatics/btr381

Fig. 1.

Fig. 1.

UCHIME schematic. The query sequence is divided into four chunks, each of which is used to search the reference database. The best few hits to each chunk are saved, and the closest two sequences are found by calculating smoothed identity with the query. A three-way chimeric alignment is constructed, and a chimera is reported if its score [Equation (2)] exceeds a preset threshold.