Pattern Matching for DNA Sequencing Data Using Multiple Bloom Filters
Storing and processing of large DNA sequences has always been a major problem due to increasing volume of DNA sequence data. However, a number of solutions have been proposed but they require significant computation and memory. Therefore, an efficient storage and pattern matching solution is require...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Published: |
Hindawi Publishing Corporation
2019
|
| Subjects: |
| _version_ | 1825722146458959872 |
|---|---|
| author | Najam, Maleeha Rasool, Raihan Ur Ahmad, Hafiz Farooq Ashraf, Usman Malik, Asad Waqar |
| author_facet | Najam, Maleeha Rasool, Raihan Ur Ahmad, Hafiz Farooq Ashraf, Usman Malik, Asad Waqar |
| author_sort | Najam, Maleeha |
| collection | UM |
| description | Storing and processing of large DNA sequences has always been a major problem due to increasing volume of DNA sequence data. However, a number of solutions have been proposed but they require significant computation and memory. Therefore, an efficient storage and pattern matching solution is required for DNA sequencing data. Bloom filters (BFs) represent an efficient data structure, which is mostly used in the domain of bioinformatics for classification of DNA sequences. In this paper, we explore more dimensions where BFs can be used other than classification. A proposed solution is based on Multiple Bloom Filters (MBFs) that finds all the locations and number of repetitions of the specified pattern inside a DNA sequence. Both of these factors are extremely important in determining the type and intensity of any disease. This paper serves as a first effort towards optimizing the search for location and frequency of substrings in DNA sequences using MBFs. We expect that further optimizations in the proposed solution can bring remarkable results as this paper presents a proof of concept implementation for a given set of data using proposed MBFs technique. Performance evaluation shows improved accuracy and time efficiency of the proposed approach. © 2019 Maleeha Najam et al. |
| first_indexed | 2024-03-06T06:01:12Z |
| format | Article |
| id | um.eprints-23898 |
| institution | Universiti Malaya |
| last_indexed | 2024-03-06T06:01:12Z |
| publishDate | 2019 |
| publisher | Hindawi Publishing Corporation |
| record_format | dspace |
| spelling | um.eprints-238982020-02-28T01:38:45Z http://eprints.um.edu.my/23898/ Pattern Matching for DNA Sequencing Data Using Multiple Bloom Filters Najam, Maleeha Rasool, Raihan Ur Ahmad, Hafiz Farooq Ashraf, Usman Malik, Asad Waqar QA75 Electronic computers. Computer science Storing and processing of large DNA sequences has always been a major problem due to increasing volume of DNA sequence data. However, a number of solutions have been proposed but they require significant computation and memory. Therefore, an efficient storage and pattern matching solution is required for DNA sequencing data. Bloom filters (BFs) represent an efficient data structure, which is mostly used in the domain of bioinformatics for classification of DNA sequences. In this paper, we explore more dimensions where BFs can be used other than classification. A proposed solution is based on Multiple Bloom Filters (MBFs) that finds all the locations and number of repetitions of the specified pattern inside a DNA sequence. Both of these factors are extremely important in determining the type and intensity of any disease. This paper serves as a first effort towards optimizing the search for location and frequency of substrings in DNA sequences using MBFs. We expect that further optimizations in the proposed solution can bring remarkable results as this paper presents a proof of concept implementation for a given set of data using proposed MBFs technique. Performance evaluation shows improved accuracy and time efficiency of the proposed approach. © 2019 Maleeha Najam et al. Hindawi Publishing Corporation 2019 Article PeerReviewed Najam, Maleeha and Rasool, Raihan Ur and Ahmad, Hafiz Farooq and Ashraf, Usman and Malik, Asad Waqar (2019) Pattern Matching for DNA Sequencing Data Using Multiple Bloom Filters. BioMed Research International, 2019. pp. 1-9. ISSN 2314-6133, DOI https://doi.org/10.1155/2019/7074387 <https://doi.org/10.1155/2019/7074387>. https://doi.org/10.1155/2019/7074387 doi:10.1155/2019/7074387 |
| spellingShingle | QA75 Electronic computers. Computer science Najam, Maleeha Rasool, Raihan Ur Ahmad, Hafiz Farooq Ashraf, Usman Malik, Asad Waqar Pattern Matching for DNA Sequencing Data Using Multiple Bloom Filters |
| title | Pattern Matching for DNA Sequencing Data Using Multiple Bloom Filters |
| title_full | Pattern Matching for DNA Sequencing Data Using Multiple Bloom Filters |
| title_fullStr | Pattern Matching for DNA Sequencing Data Using Multiple Bloom Filters |
| title_full_unstemmed | Pattern Matching for DNA Sequencing Data Using Multiple Bloom Filters |
| title_short | Pattern Matching for DNA Sequencing Data Using Multiple Bloom Filters |
| title_sort | pattern matching for dna sequencing data using multiple bloom filters |
| topic | QA75 Electronic computers. Computer science |
| work_keys_str_mv | AT najammaleeha patternmatchingfordnasequencingdatausingmultiplebloomfilters AT rasoolraihanur patternmatchingfordnasequencingdatausingmultiplebloomfilters AT ahmadhafizfarooq patternmatchingfordnasequencingdatausingmultiplebloomfilters AT ashrafusman patternmatchingfordnasequencingdatausingmultiplebloomfilters AT malikasadwaqar patternmatchingfordnasequencingdatausingmultiplebloomfilters |