Fast identification and statistical evaluation of segmental homologies in comparative maps

摘要

Motivation: Chromosomal segments that share common ancestry, either through genomic duplication or species divergence, are said to be segmental homologs of one another. Their identification allows researchers to leverage knowledge of model organisms for use in other systems and is of value for studies of genome evolution. However, identification and statistical evaluation of segmental homologies can be a challenge when the segments are highly diverged. Results: We describe a flexible dynamic programming algorithm for the identification of segments having multiple homologous features. We model the probability of observing putative segmental homologies by chance and incorporate our findings into the parameterization of the algorithm and the statistical evaluation of its output. Combined, these findings allow segmental homologies to be identified in comparisons within and between genomic maps in a rigorous, rapid, and automated fashion.