Abstract
Background: 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.
Objective: The main purpose of this paper is to review first briefly all available DNA string matching methodologies that are based on crisp logic and then to suggest a new method based on the fuzzy logic rules and application.
Methods:
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 researchers even by taking into consideration probabilistic random variability components based on the probability distribution functions of various types.
Results:
Fuzzy number representation of each gene implies some sort of uncertainty or unhealthiness in some or all the genes. Their better identifications can be achieved on the basis of fuzzy numbers with different membership degrees, which imply the unhealthiness or healthiness of the genes and their collective behaviors.
Conclusion: After the development of fuzzy number representation of the text string coupled with crisp pattern string their relationships are searched at different shift operations, and hence, the possibility of defaulters are identified in the text string with a certain degree of membership.
Publisher
Bentham Science Publishers Ltd.
Subject
Health Informatics,Biomedical Engineering,Computer Science (miscellaneous)
Reference26 articles.
1. Alsmadi I, Nuser M.
String matching evaluation methods for dna comparison.
Int J Adv Sci Technol
2014;
47
: 13-31.
2. Nsira BN, Elloumi M, Lecroq T.
On-line string matching in highly similar dna sequences.
Math Comput Sci
2017;
11
: 113-26.
3. Huang S, Lam TW, Sung W-K, Tam S-L, Yiu S-M.
Indexing similar DNA sequences.
In: Chen, B (ed) Proceedings of the 6th International Conference on Algorithmic Aspects in Information and Management (AAIM 2010), Lecture Notes in Computer Science
Springer. 2010; pp.
2010;
6124
: 180-90.
4. Alatabbi A, Barton C, Iliopoulos CS, Mouchard L.
Querying highly similar structured sequences via binary encoding and word level operations. In: liadis LS, Aglogiannis I, Papadopoulos H, Karatzas K, Sioutas S, Eds.
Proceedings of the International Workshop Artificial Intelligence Applications and Innovations (AIAI 2012) Part II, IFIP Advances in Information and Communication Technology
2012;
382
: 584-92.
5. Hossen MR, Azam MS, Rana HK.
Performance evaluation of various dna pattern matching algorithms using different genome datasets.
Pabna University of Science and Technology Studies
2018;
3
(1)
: 14-8.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献