Efficient Extraction Method for Biological Data Using Boyer-Moore Search Algorithm

被引：0

作者：

Jaber, Khalid Mohammad ^{[1
]}

Al-Khatib, Ra'ed M. ^{[2
]}

Taghizadeh, Alireza ^{[3
]}

Al-Khateeb, Asef ^{[4
]}

机构：

[1] Al Zaytoonah Univ Jordan, Fac Sci & Informat Technol, Amman, Jordan

[2] Univ Sains Malaysia, Sch Comp Sci, George Town, Malaysia

[3] Islamic Azad Univ Parand PIAU, Comp IT Engn Dept, Tehran, Iran

[4] Al Imam Muhammad Ibn Saud Islamic Univ, Dept Comp Sci Coll Sharia Islamic Studies, Al Ahsaa, Saudi Arabia

来源：

CREATING GLOBAL COMPETITIVE ECONOMIES: 2020 VISION PLANNING & IMPLEMENTATION, VOLS 1-3 | 2013年

关键词：

Bioinformatics; DNA-protein GenBank databases; biological sequences; Boyer-Moore search algorithm; MATCHING ALGORITHM; SEQUENCE DATABASE; SOFTWARE;

D O I：

暂无

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

Exponential growth of the biological data raises a fundamental problem for meaningful extraction of information from the huge GenBank databases. The Bioinformatics computational methods have been efficiently applied for extracting, searching, integrating and analyzing the biological data. In this paper, we propose an innovative extraction method, called Bio-BM, which uses the Boyer-Moore search algorithm to solve the problem of biological data selection and analysis. Experimental performance and evaluation process is utilized to compare the new Bio-BM method to the state-of-the-art biological search methods using the real benchmark datasets. The effectiveness and high-performance of the proposed method show more accurate results over the real biological datasets from GenBank.

引用

页码：1274 / +

页数：5

共 50 条

[31] Correctness of sub string-preprocessing in Boyer-Moore's pattern matching algorithm
Stomp, F
THEORETICAL COMPUTER SCIENCE, 2003, 290 (01) : 59 - 78
[32] Mechanization of a proof of string-preprocessing in Boyer-Moore's pattern matching algorithm
Besta, M
Stomp, F
EIGHTH IEEE INTERNATIONAL CONFERENCE ON ENGINEERING OF COMPLEX COMPUTER SYSTEMS, PROCEEDINGS, 2002, : 68 - 77
[33] PATSIM: Prediction and analysis of protein sequences using hybrid Knuth-Morris Pratt (KMP) and Boyer-Moore (BM) algorithm
Manikandan, P.
Ramyachitra, D.
GENE, 2018, 657 : 50 - 59
[34] Interaction with the Boyer-Moore theorem prover: A tutorial study using the arithmetic-geometric mean theorem
Kaufmann, M
Pecchiari, P
JOURNAL OF AUTOMATED REASONING, 1996, 16 (1-2) : 181 - 222
[35] A Framework for Parallel Boyer-Moore-Quick Search Algorithm (P-BM-QS)
Faber, Khalid Mohammad
Ibrahim, Dyala R.
Al-Sanhani, Asma H.
Hamad, Nesreen A.
VISION 2020: SUSTAINABLE ECONOMIC DEVELOPMENT, INNOVATION MANAGEMENT, AND GLOBAL GROWTH, VOLS I-IX, 2017, 2017, : 1623 - 1628
[36] Enhanced pattern matching performance using improved boyer moore horspool Algorithm
Hong, D. (dear_red9@163.com), 1600, Advanced Institute of Convergence Information Technology (07):
[37] An efficient substring search method by using delayed keyword extraction
Okada, M
Ando, K
Lee, SS
Hayashi, Y
Aoe, J
INFORMATION PROCESSING & MANAGEMENT, 2001, 37 (05) : 741 - 761
[38] AN EFFICIENT EXTRACTION METHOD FOR CLOSED LOOPS USING A GRAPH SEARCH TECHNIQUE
SATOH, S
MO, H
SAKAUCHI, M
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1995, E78A (05) : 583 - 586
[39] Efficient extraction method for closed loops using a graph search technique
Natl Cent for Science Information, Systems, Tokyo, Japan
IEICE Trans Fund Electron Commun Comput Sci, 5 (583-586):
[40] Shape Extraction Method using Search for Convex Hull by Genetic Algorithm
Matayoshi, Mitsukuni
2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013), 2013, : 1677 - 1683

← 1 2 3 4 5 →