Efficient motif finding algorithms for large-alphabet inputs

@inproceedings{Kuksa2010EfficientMF,
  title={Efficient motif finding algorithms for large-alphabet inputs},
  author={Pavel P. Kuksa and Vladimir Pavlovic},
  booktitle={BMC Bioinformatics},
  year={2010}
}
We consider the problem of identifying motifs, recurring or conserved patterns, in the biological sequence data sets. To solve this task, we present a new deterministic algorithm for finding patterns that are embedded as exact or inexact instances in all or most of the input strings. The proposed algorithm (1) improves search efficiency compared to existing algorithms, and (2) scales well with the size of alphabet. On a synthetic planted DNA motif finding problem our algorithm is over 10× more… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 21 references

HCM: Voting algorithms for discovering long motifs

  • Chin FYL, Leung
  • APBC
  • 2005
3 Excerpts

Similar Papers

Loading similar papers…