iSeg:一种基因组数据分割算法
iSeg: an algorithm for segmentation of genomic data
摘要:
基因组的功能元件的鉴定通常需要将沿着基因组的测量序列分成与相邻区段不同的区段。在许多应用中,在区段中的多个基因组位置处的测量值的平均值用于推断感兴趣的性质。具有非零平均值的区段通常对应于具有某些生物事件的基因组区域,例如两种条件之间的变化。这个问题在基因组学领域通常被称为分割问题,在其他科学学科中被称为变点问题。我们设计了一种高效的算法,称为iSeg,用于高通量基因组图谱的分割。iSeg首先利用动态编程来计算大量候选片段的重要性。然后,它使用基于树的数据结构来检测重叠的重要区域,并同时更新它们。在最后进行重要分段的细化和合并以生成最终分段。我们使用模拟和实验数据集评估iSeg,并表明与现有方法相比,它的性能相当不错。
英文摘要:
Identification of functional elements of a genome often requires dividing a sequence of measurements along a genome into segments differing from adjacent segments. In many applications, the mean of the measured values at multiple genomic locations in a segment is used to make inference of the property of interest. The segments with non-zero means often correspond to genomic regions with certain biological events, such as changes between two conditions. This problem is often called the segmentation problem in the field of genomics, and the change-point problem in other scientific disciplines. We designed an efficient algorithm, called iSeg, for segmentation of high-throughput genomic profiles. iSeg first utilizes dynamic programming to compute the significance for a large number of candidate segments. It then uses tree-based data structures to detect overlapping significant regions and update them simultaneously. Refinement and merging of significant segments are performed at the end to generate the final segmentation. We evaluate iSeg using both simulated and experimental datasets and show that it performs quite well when compared with existing methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。