Comparative Study of Motif Finding Algorithms and Efficient Motif Search Using KMP

V. S. S. Ashish Babu, Daggubati Praneesha, Injeti Hemanth, P. Ravi Charan, Rishu Jaiswal, Gayathri Ramasamy

2025

Abstract

Different algorithms of finding motifs like Brute Force, Greedy, Randomized, and KMP (Knuth-Morris-Pratt) to determine the most efficient one. So, in the implementation phase, these algorithms are going to be implemented in order to provide the comparison in terms of time, best score, and complexity. This project is going to implement the result of the comparison using graphical user interface components in an organized table format, thus highlighting the time in microseconds it takes to carry out the task for each algorithm and detailed analysis of the complexity. This result is then applied to searching for the best motif in a larger dataset, thus showing the applicability in real terms of the KMP algorithm for efficient detection of motifs. All this analysis will help in deciding the best algorithm to find the motifs and will, in turn, help provide insight that will be adopted in bioinformatics research.

Paper Citation

in Harvard Style

Babu V., Praneesha D., Hemanth I., Charan P., Jaiswal R. and Ramasamy G. (2025). Comparative Study of Motif Finding Algorithms and Efficient Motif Search Using KMP. In Proceedings of the 1st International Conference on Research and Development in Information, Communication, and Computing Technologies - ICRDICCT`25; ISBN 978-989-758-777-1, SciTePress, pages 33-39. DOI: 10.5220/0013907700004919

in Bibtex Style

@conference{icrdicct`2525,
author={V. Babu and Daggubati Praneesha and Injeti Hemanth and P. Charan and Rishu Jaiswal and Gayathri Ramasamy},
title={Comparative Study of Motif Finding Algorithms and Efficient Motif Search Using KMP},
booktitle={Proceedings of the 1st International Conference on Research and Development in Information, Communication, and Computing Technologies - ICRDICCT`25},
year={2025},
pages={33-39},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0013907700004919},
isbn={978-989-758-777-1},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 1st International Conference on Research and Development in Information, Communication, and Computing Technologies - ICRDICCT`25
TI - Comparative Study of Motif Finding Algorithms and Efficient Motif Search Using KMP
SN - 978-989-758-777-1
AU - Babu V.
AU - Praneesha D.
AU - Hemanth I.
AU - Charan P.
AU - Jaiswal R.
AU - Ramasamy G.
PY - 2025
SP - 33
EP - 39
DO - 10.5220/0013907700004919
PB - SciTePress