Jackson Benjamin N, Aluru Srinivas, Schnable Patrick S
Dept. of Electrical and Computer Engineering, Iowa State University, Ames, IA 50010, USA.
Proc IEEE Comput Syst Bioinform Conf. 2005:35-43. doi: 10.1109/csb.2005.26.
A genetic map is an ordering of genetic markers constructed from genetic linkage data for use in linkage studies and experimental design. While traditional methods have focused on constructing maps from a single population study, increasingly maps are generated for multiple lines and populations of the same organism. For example, in crop plants, where the genetic variability is high, researchers have created maps for many populations. In the face of these new data, we address the increasingly important problem of generating a consensus map - an ordering of all markers in the various population studies. In our method, each input map is treated as a partial order on a set of markers. To find the most consistent order shared between maps, we model the partial orders as directed graphs. We create an aggregate by merginging the transitive closure of the input graphs and taking the transitive reduction of the result. In this process, cycles may need to be broken to resolve inconsistencies between the inputs. The cycle breaking problem is NP-hard, but the problem size depends upon the scope of the inconsistency between the input graphs, which will be local if the input graphs are from closely related organisms. We present results of running the resulting software on maps generated from seven populations of the crop plant Zea Mays.
遗传图谱是根据遗传连锁数据构建的遗传标记排序,用于连锁研究和实验设计。传统方法侧重于从单一群体研究构建图谱,而现在越来越多地为同一生物体的多个品系和群体生成图谱。例如,在遗传变异性高的作物中,研究人员为许多群体创建了图谱。面对这些新数据,我们解决了生成共识图谱这一日益重要的问题——即在各种群体研究中对所有标记进行排序。在我们的方法中,每个输入图谱都被视为一组标记上的偏序。为了找到图谱之间最一致的顺序,我们将偏序建模为有向图。我们通过合并输入图的传递闭包并对结果进行传递简约来创建一个聚合图。在此过程中,可能需要打破循环以解决输入之间的不一致。打破循环问题是NP难问题,但问题大小取决于输入图之间不一致的范围,如果输入图来自密切相关的生物体,那么不一致将是局部的。我们展示了在由作物玉米的七个群体生成的图谱上运行所得软件的结果。