PairMotif: A New Pattern-Driven Algorithm for Planted (l, d) DNA Motif Search
Motif search is a fundamental problem in bioinformatics with an important application in locating transcription factor binding sites (TFBSs) in DNA sequences. The exact algorithms can report all (l, d) motifs and find the best one under a specific objective function. However, it is still a challengi...
| Main Authors: | , , , |
|---|---|
| Format: | Online |
| Language: | English |
| Published: |
Public Library of Science
2012
|
| Online Access: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3485246/ |