Suppr超能文献

过往字符串的重建。

Reconstruction of strings past.

作者信息

Yee C N, Allison L

机构信息

Department of Computer Science, Monash University, Australia.

出版信息

Comput Appl Biosci. 1993 Feb;9(1):1-7.

PMID:8435759
Abstract

A major use of string-alignment algorithms is to compare macromolecules that are thought to have evolved from a common ancestor to estimate the duration of, or the amount of mutation in, their separate evolution and to infer as much as possible about their most recent common ancestor. Minimum message length encoding, a method of inductive inference, is applied to the string-alignment problem. It leads to an alignment method that averages over all alignments in a weighted fashion. Experiments indicates that this method can recover the actual parameters of evolution with high accuracy and over a wide range of values, whereas the use of a single optimal alignment gives biased results.

摘要

字符串比对算法的一个主要用途是比较被认为由共同祖先演化而来的大分子,以估计它们各自演化的持续时间或突变量,并尽可能推断它们最近的共同祖先。最小消息长度编码是一种归纳推理方法,被应用于字符串比对问题。它产生了一种以加权方式对所有比对进行平均的比对方法。实验表明,这种方法能够在很宽的值范围内高精度地恢复演化的实际参数,而使用单一的最优比对会给出有偏差的结果。

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验