Recombination as a point process along sequences
Recombination as a point process along sequences
复制标题
DOI：
10.1006/tpbi.1998.1403
复制
发表时间：
1999-06-01
影响因子：
1.4
通讯作者：
Hein, J
中科院分区：
文献类型：
--
作者：
Wiuf, C;Hein, J
可以使用将现有序列样本作为输入的算法来模拟具有重组的合并模型中的序列的历史。该算法追踪时间倒流的序列的历史，遇到重组和合并(复制)，直到祖先材料位于一个序列上以寻找当前序列中的同源位置。这里，另一种算法不是回到时间并对序列进行操作，而是通过沿序列在空间上移动，在遇到重组点时更新序列的历史。该算法侧重于与重组相结合的空间方面，而不是像熟悉的算法那样关注时间方面。导出了与复合结合的空间方面有关的数学结果。(C)1999年学术出版社。
Histories of sequences in the coalescent model with recombination can be simulated using an algorithm that takes as input a sample of extant sequences. The algorithm traces the history of the sequences going back in time, encountering recombinations and coalescence (duplications) until the ancestral material is located on one sequence for homologous positions in the present sequences. Here an alternative algorithm is formulated not as going back in time and operating on sequences, but by moving spatially along the sequences, updating the history of the sequences as recombination points are encountered. This algorithm focuses on spatial aspects of the coalescent with recombination rather than on temporal aspects as is the case of familiar algorithms. Mathematical results related to spatial aspects of the coalescent with recombination are derived. (C) 1999 Academic Press.