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
关键词
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 条
  • [1] A VARIATION ON THE BOYER-MOORE ALGORITHM
    LECROQ, T
    THEORETICAL COMPUTER SCIENCE, 1992, 92 (01) : 119 - 144
  • [2] Fast-search: A new efficient variant of the Boyer-Moore string matching algorithm
    Cantone, D
    Faro, S
    EXPERIMENTAL AND EFFICIENCT ALGORITHMS, PROCEEDINGS, 2003, 2647 : 47 - 58
  • [3] Fingerprint Identification using Bozorth and Boyer-Moore Algorithm
    Supatmi, S.
    Sumitra, I. D.
    2ND INTERNATIONAL CONFERENCE ON INFORMATICS, ENGINEERING, SCIENCE, AND TECHNOLOGY (INCITEST 2019), 2019, 662
  • [4] ON THE EXPECTED SUBLINEARITY OF THE BOYER-MOORE ALGORITHM
    SCHABACK, R
    SIAM JOURNAL ON COMPUTING, 1988, 17 (04) : 648 - 658
  • [5] Composite string matching algorithm based on boyer-moore method
    Huang, Wenqi
    Xiong, Zhengda
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2009, 37 (12): : 48 - 51
  • [6] Searching BWT compressed text with the Boyer-Moore algorithm and binary search
    Bell, T
    Powell, M
    Mukherjee, A
    Adjeroh, D
    DCC 2002: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2002, : 112 - 121
  • [7] Visual Approach of Searching Process using Boyer-Moore Algorithm
    Rahim, Robbi
    Ahmar, Ansari Saleh
    Ardyanti, Ayu Putri
    Nofriansyah, Dicky
    INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY (ICONICT), 2017, 930
  • [8] Average case analysis of the Boyer-Moore algorithm
    Tsai, Tsung-Hsi
    RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (04) : 481 - 498
  • [9] A Method for Web Application Vulnerabilities Detection by Using Boyer-Moore String Matching Algorithm
    Saleh, Ain Zubaidah Mohd
    Rozali, Nur Amizah
    Buja, Alya Geogiana
    Jalil, Kamarularifin Abd.
    Ali, Fakariah Hani Mohd
    Rahman, Teh Faradilla Abdul
    THIRD INFORMATION SYSTEMS INTERNATIONAL CONFERENCE 2015, 2015, 72 : 112 - 121
  • [10] A Boyer-Moore type algorithm for compressed pattern matching
    Shibata, Y
    Matsumoto, T
    Takeda, M
    Shinohara, A
    Arikawa, S
    COMBINATORIAL PATTERN MATCHING, 2000, 1848 : 181 - 194