| Autor: |
Allison L; Department of Computer Science, Monash University, Australia., Yee CN |
| Jazyk: |
angličtina |
| Zdroj: |
Bulletin of mathematical biology [Bull Math Biol] 1990; Vol. 52 (3), pp. 431-53. |
| DOI: |
10.1007/BF02458580 |
| Abstrakt: |
A comparison 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. |
| Databáze: |
MEDLINE |
| Externí odkaz: |
|
Full text from SpringerLink