Abstract
The considerable growth of biological data motivates the researchers to solve the different problems in computational bioinformatics. Pattern matching is applied as an important operation in different phases of the computational pipelines. For instance, by pattern matching, the users are enabled to find the locations of particular DNA subsequences in a DNA sequence or biological database. In addition, some patterns of these expanding biological databases are updated over time. Quick pattern matching algorithms are required to perform faster searches. To speed up searches on large DNA sequences, this paper proposes two pattern matching algorithms. The proposed algorithms raise performance by finding the windows of the sequence via the first and last characters of the pattern and also by employing word-based processing instead of the characterbased processing presented in previous works. The experimental results reveal the superiority of the presented algorithms over the other simulated algorithms in terms of time cost.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
