Sequence distances based on exhaustive substring composition
暂无分享,去创建一个
[1] Joong Chae Na,et al. Truncated suffix trees and their application to data compression , 2003, Theor. Comput. Sci..
[2] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .
[3] J. Qi,et al. Whole Proteome Prokaryote Phylogeny Without Sequence Alignment: A K-String Composition Approach , 2003, Journal of Molecular Evolution.
[4] Alberto Apostolico,et al. The Myriad Virtues of Subword Trees , 1985 .
[5] Bin Ma,et al. The similarity metric , 2001, IEEE Transactions on Information Theory.
[6] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[7] Abraham Lempel,et al. On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.
[8] Richard Von Mises,et al. Probability, statistics and truth , 1939 .
[9] A. A.. Probability, Statistics and Truth , 1940, Nature.
[10] Calyampudi Radhakrishna Rao,et al. Statistics and truth , 1997 .
[11] David Burstein,et al. The Average Common Substring Approach to Phylogenomic Reconstruction , 2006, J. Comput. Biol..
[12] S. S. Wilks,et al. Probability, statistics and truth , 1939 .
[13] Lila L. Gatlin,et al. Information theory and the living system , 1972 .
[14] L. Brillouin,et al. Science and information theory , 1956 .