Fuzzy String Matching Procedure

Q3 Computer Science

Open Bioinformatics Journal Pub Date : 2020-05-23 DOI:10.2174/1875036202013010050

Zekâi Şen

引用次数: 1

Abstract

There are different methodologies for DNA comparison based on two string algorithms, which are dependent on crisp logical principles, where there is no room for verbal (linguistic) uncertainty. These are successfully applicable procedures in DNA bioinformatics researches even by taking into consideration probabilistic random variability components based on the probability distribution functions of various types.

查看原文本刊更多论文

模糊字符串匹配过程

基于两种字符串算法的DNA比较有不同的方法，这取决于清晰的逻辑原则，在这些原则中没有言语（语言）不确定性的空间。即使考虑了基于各种类型的概率分布函数的概率随机变异成分，这些程序也能成功地应用于DNA生物信息学研究。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Open Bioinformatics Journal Computer Science-Computer Science (miscellaneous)

CiteScore

2.40

自引率

0.00%

发文量

期刊介绍： The Open Bioinformatics Journal is an Open Access online journal, which publishes research articles, reviews/mini-reviews, letters, clinical trial studies and guest edited single topic issues in all areas of bioinformatics and computational biology. The coverage includes biomedicine, focusing on large data acquisition, analysis and curation, computational and statistical methods for the modeling and analysis of biological data, and descriptions of new algorithms and databases. The Open Bioinformatics Journal, a peer reviewed journal, is an important and reliable source of current information on the developments in the field. The emphasis will be on publishing quality articles rapidly and freely available worldwide.