Minimum message length encoding and the comparison of macromolecules
From MaRDI portal
Publication:912791
DOI10.1007/BF02458580zbMath0698.92014OpenAlexW2010961546WikidataQ62654297 ScholiaQ62654297MaRDI QIDQ912791
Publication date: 1990
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02458580
inductive inferencemolecular biologystring comparisonfast minimum message length alignment algorithmminimum message length encodingmodels of string mutationposterior odds-ratiostring alignment algorithms
Prefix, length-variable, comma-free codes (94A45) Physiological, cellular and medical topics (92Cxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- General methods of sequence comparison
- On the syntactic structure of protein sequences and the concept of grammar complexity
- A universal prior for integers and estimation by minimum description length
- Sequence comparison with concave weighting functions
- Protein constraints induced by multiframe encoding
- Matching code sequences utilizing context free quality measures
- An Introduction to Arithmetic Coding
- The theory and computation of evolutionary distances: Pattern recognition
- On the Theory and Computation of Evolutionary Distances
- A linear space algorithm for computing maximal common subsequences
- On the Length of Programs for Computing Finite Binary Sequences
- An Information Measure for Classification
- A formal theory of inductive inference. Part I
- On Computable Numbers, with an Application to the Entscheidungsproblem
This page was built for publication: Minimum message length encoding and the comparison of macromolecules
