图 书 馆
基于有限归纳法的句法模式识别的复杂性与应用The Complexity and Application of Syntactic Pattern Recognition Using Finite Inductive Strings |
|
| 课程网址: | http://videolectures.net/prib2010_myers_casp/ |
| 主讲教师: | Elijah Myers |
| 开课单位: | 温斯顿·塞勒姆州立大学 |
| 开课时间: | 2010-10-14 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | We describe herein the results of implementing an algorithm for syntactic pattern recognition using the concept of Finite Inductive Sequences (FI). We discuss this idea, and then provide a big O estimate of the time to execute for the algorithms. We then provide some empirical data to support the analysis of the timing. This timing is critical if one wants to process millions of symbols from multiple sequences simultaneously. Lastly, we provide an example of the two FI algorithms applied to actual data taken from a gene and then describe some results as well as the associated data derived from this example. |
| 关 键 词: | 感应序列; 句法模式识别; 基因; 算法 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-06-02：张荧(课程编辑志愿者) |
| 阅读次数: | 46 |