LL-PMS8: A time efficient approach to solve planted motif search problem
Among other motif finding algorithms Planted Motif Search (PMS) or (ℓ, d) motif search algorithms are considered as next-generation motif finding algorithms. Here, n strings and two integer ℓ and d are provided as input in PMS. It gives outputs of all sequences of length M in each input string, wher...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2022-06-01
|
| Series: | Journal of King Saud University: Computer and Information Sciences |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1319157820305553 |