Minimum message length encoding, evolutionary trees and multiple-alignment
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. i, 663-674 vol.1
- https://doi.org/10.1109/hicss.1992.183219
Abstract
A method of Bayesian inference known as minimum message length encoding is applied to the inference of an evolutionary-tree and to multiple-alignment for k>or=2 strings. It allows the posterior odds-ratio of two competing hypotheses, for example two trees, to be calculated. A tree that is a good hypothesis forms the basis of a short message describing the strings. The mutation process is modelled by a finite-state machine. It is seen that tree inference and multiple-alignment are intimately connected.Keywords
This publication has 16 references indexed in Scilit:
- An improved algorithm for matching biological sequencesPublished by Elsevier ,2004
- Isolation, characterization, cDNA cloning and gene expression of an avian transthyretinEuropean Journal of Biochemistry, 1991
- Optimal sequence alignment allowing for long gapsBulletin of Mathematical Biology, 1990
- Quantitative Aspects of the Estimation of Evolutionary TreesFolia Primatologica, 1989
- Trees, Stars, and Multiple Biological Sequence AlignmentSIAM Journal on Applied Mathematics, 1989
- Sequence comparison with concave weighting functionsBulletin of Mathematical Biology, 1988
- Maximum likelihood alignment of DNA sequencesJournal of Molecular Biology, 1986
- The alignment of sets of sequences and the construction of phyletic trees: An integrated methodJournal of Molecular Evolution, 1984
- Evolutionary trees from DNA sequences: A maximum likelihood approachJournal of Molecular Evolution, 1981
- The information content of a multistate distributionJournal of Theoretical Biology, 1969