L. Allison, and C. N. Yee, Bulletin of Mathematical Biology, 52(3), pp.431-453, doi:10.1007/BF02458580, May 1990

Abstract A method of inductive inference known as minimum message length encoding is applied to string comparison in molecular biology. The question of whether or not two strings are related and, if so, of how they are related and the problem of finding a good theory of string mutation are treated as inductive inference problems. The method allows the posterior odds-ratio of two string alignments or of two models of string mutation to be computed. The connection between models of mutation and existing string alignment algorithms is made explicit. A fast minimum message length alignment algorithm is also described.