文章基本信息

标题：Approximate string matching Algorithm .
本地全文：下载
作者：Narendra Kumar ; Vipin Kumar ; Amit Kumar 等
期刊名称：International Journal on Computer Science and Engineering
印刷版ISSN：2229-5631
电子版ISSN：0975-3397
出版年度：2010
卷号：2
期号：3
页码：641-644
出版社：Engg Journals Publications
摘要：Approximate string matching is used when a query string is similar to but not identical with desired matches many patterns can be symbolically encoded as strings. Approximate string matching is the process of searching for optimal alignment of two finite-length strings in which comparable patterns may not be obvious; long strings subject to natural variations or random noise, for example, may share subtle, characteristic, underlying patterns of symbols. Use of the term approximate merely emphasizes the fact that a perfect match may not be achievable and that imperfections such as missing and extraneous symbols have to be considered. In many applications, one of the two strings is a prototype string that represents a pattern class and the other is a test string that we wish to analyze and/or classify.
关键词：DNA - Deoxyribonucleic acid; Lexicon � A method of analysis; Substitution � A method to substitute something in place of other.