DefinePK

Research Objective

To present a taxonomy and performance evaluation of DNA pattern matching algorithms, and to establish a research trend and find a mathematical model to estimate execution search time before scanning whole DNA sequences.

Methodology

Systematic Literature Review (SLR) involving formulating research questions, forming search queries using keywords and boolean operators, and selecting relevant papers based on strict inclusion and exclusion criteria. The review focused on papers published in quality journals, conferences, and workshops.

Methodology Flowchart

                        graph TD;
    A[Formulate Research Questions] --> B[Define Search Query];
    B --> C[Execute Search on Repositories];
    C --> D[Filter Papers based on Inclusion/Exclusion Criteria];
    D --> E[Analyze Selected Papers];
    E --> F[Synthesize Findings and Answer Research Questions];
    F --> G[Draw Conclusions and Recommendations];                    

Discussion

The study highlights the increasing importance of efficient DNA pattern matching algorithms due to the exponential growth of DNA databases. It critiques existing reviews for their limited scope and proposes a more comprehensive approach. The discussion also touches upon the challenges in bioinformatics, such as minimizing comparisons for pattern matching and predicting disease-related mutations.

Key Findings

Journals are the primary publication venues for DNA pattern matching algorithms research, followed by conferences. Time complexity and space complexity are the most frequently addressed performance evaluation parameters, while relevancy, mutation rate, and location of mutated regions are less addressed.

Conclusion

This systematic literature review provides an understanding of the research trends in DNA pattern matching algorithms. The study emphasizes the need for more attention on developing mathematical models for predicting search time and identifying mutated regions, and suggests potential improvements for existing algorithms.

Fact Check

1. The study was received on 09.02.2022 and accepted on 09.05.2022. (Confirmed by text)
2. The paper discusses 50 algorithms in one of the cited studies [5]. (Confirmed by text)
3. The review selected approximately fifty articles for its research. (Confirmed by text)

Mind Map