Figure 3.

Three different non-ambigous automata derived from the one depicted in Figure 2. These automata are designed to have a bijective mapping between the states and the labels (after the corresponding re-labeling of the sequences). In the text they are referred as CRF1 (a), CRF2 (b) and CRF3 (c).

Fariselli et al. Algorithms for Molecular Biology 2009 4:13   doi:10.1186/1748-7188-4-13
Download authors' original image