树阵,在生物序列中查找模式,网络优化Trees, Arrays, Networks and Optimization for Finding Patterns in Biological Sequences |
|
课程网址: | http://videolectures.net/aop05_gusfield_tanof/ |
主讲教师: | Dan Gusfield |
开课单位: | 加州大学 |
开课时间: | 2007-02-25 |
课程语种: | 英语 |
中文简介: | a) 使用后缀树和整数编程来查找最佳病毒签名。b) 后缀阵列及其用途的当前处理。在过去几年中, 开发了用于构建后缀数组的简单线性时间算法, 使得显式后缀树大多过时。c) 用于在 snp (二进制) 序列中查找历史重组和基因转换特征 (模式) 的算法。这里的技术与图论有关。 |
课程简介: | a) The use of suffix trees and integer programming for finding optimal virus signatures. b) A current treatment of suffix-arrays and their uses. In the last several years simple linear-time algorithms for building suffix arrays have been developed making explicit suffix-trees mostly obsolete. c) Algorithms for finding signatures (patterns) of historical recombination and gene-conversion in SNP (binary) sequences. The techniques here relate to graph-theory. |
关 键 词: | 计算机科学; 机器学习; 模式识别 |
课程来源: | 视频讲座网 |
最后编审: | 2020-06-12:张荧(课程编辑志愿者) |
阅读次数: | 69 |