Skip to main content
Fig. 2 | Algorithms for Molecular Biology

Fig. 2

From: The paralog-to-contig assignment problem: high quality gene models from fragmented assemblies

Fig. 2

Illustration of the paralog-to-contig assignment problem. In this hypothetical example, each of the three paralogous genes has 11 coding exons which are homologous to the respective exon of the other paralogs (numbers 1–11). The paralogs are distributed over 11 contigs of different sizes, which are denoted by letters. TCE-hits on the 11 contigs are colored according to the query paralog \(Q_i\) that scored best (yellow query paralog \(Q_1\), red query paralog \(Q_2\), blue query paralog \(Q_3\)). The lower part of the figure shows the assignment identified by the EMS-pipeline. Note, that exon 5 of paralog 1 is inserted into contig a that carries exons 2–4 and 6. Putative missing (or deleted) exons are shown as dotted boxes. TCE translated coding exon

Back to article page