Trie-PMS8: A trie-tree based robust solution for planted motif search problem
Finding patterns in biological sequences is a crucial and intriguing task. This paper explores the (Ɩ, d) motif search problem, also known as Planted Motif Search (PMS), and discusses its challenging nature as an NP-hard problem. PMS and (Ɩ, d) motif search algorithms are believed to represent the n...
Guardat en:
| Autors principals: | , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
KeAi Communications Co., Ltd.
2024-01-01
|
| Col·lecció: | International Journal of Cognitive Computing in Engineering |
| Matèries: | |
| Accés en línia: | http://www.sciencedirect.com/science/article/pii/S2666307424000251 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|