Evolutionary Trees and Ordinal Assertions

被引:0
|
作者
P. E. Kearney
R. B. Hayward
H. Meijer
机构
[1] Department of Computer Science,
[2] University of Waterloo,undefined
[3] Waterloo,undefined
[4] Ontario,undefined
[5] Canada N2L 3G1. pkearney@math.uwaterloo.ca.,undefined
[6] Department of Mathematics and Computer Science,undefined
[7] University of Lethbridge,undefined
[8] 4401 University Drive West,undefined
[9] Lethbridge,undefined
[10] Alberta,undefined
[11] Canada T1K 3M4. hayward@cs.uleth.ca.,undefined
[12] Department of Computing and Information Science,undefined
[13] Queen's University,undefined
[14] Kingston,undefined
[15] Ontario,undefined
[16] Canada K7L 3N6. henk@qucis.queensu.ca.,undefined
来源
Algorithmica | 1999年 / 25卷
关键词
Key words. Distance matrix, Evolution, Ordinal, Phylogeny, Species, Tree.;
D O I
暂无
中图分类号
学科分类号
摘要
Sequence data for a group of species is often summarized by a distance matrix M where M[s,t] is the dissimilarity between the sequences of species s and t . An ordinal assertion is a statement of the form ``species a and b are as similar as species c and d '' and is supported by distance matrix M if M[a,b] ≤ M[c,d] . Recent preliminary research suggests that ordinal assertions can be used to reconstruct the evolutionary history of a group of species effectively. However, further research on the mathematical and algorithmic properties of ordinal assertions is needed to facilitate the development and assessment of inference methods that utilize ordinal assertions for reconstructing evolutionary histories.
引用
收藏
页码:196 / 221
页数:25
相关论文
共 50 条