期刊
JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY
卷 11, 期 2, 页码 -出版社
IMPERIAL COLLEGE PRESS
DOI: 10.1142/S0219720012500254
关键词
Phylogenetics; reconciliation; graph representation
类别
资金
- Phylariane project [ANR-08-EMER-011]
- ANCESTROME project [ANR-10-IABI-0-01]
Comparative genomic studies are often conducted by reconciliation analyses comparing gene and species trees. One of the issues with reconciliation approaches is that an exponential number of optimal scenarios is possible. The resulting complexity is masked by the fact that a majority of reconciliation software pick up a random optimal solution that is returned to the end-user. However, the alternative solutions should not be ignored since they tell different stories that parsimony considers as viable as the output solution. In this paper, we describe a polynomial space and time algorithm to build a minimum reconciliation graph - a graph that summarizes the set of all most parsimonious reconciliations. Amongst numerous applications, it is shown how this graph allows counting the number of non-equivalent most parsimonious reconciliations.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据