Welcome to the InfoSci Platform
Identification of Distinguishing Motifs

Identification of Distinguishing Motifs

Wangsen Feng, Lusheng Wang
Copyright: © 2010 |Volume: 1 |Issue: 3 |Pages: 15
ISSN: 1947-9115|EISSN: 1947-9123|EISBN13: 9781609609771|DOI: 10.4018/jkdb.2010070104
Cite Article Cite Article

MLA

Feng, Wangsen, and Lusheng Wang. "Identification of Distinguishing Motifs." IJKDB vol.1, no.3 2010: pp.53-67. http://doi.org/10.4018/jkdb.2010070104

APA

Feng, W. & Wang, L. (2010). Identification of Distinguishing Motifs. International Journal of Knowledge Discovery in Bioinformatics (IJKDB), 1(3), 53-67. http://doi.org/10.4018/jkdb.2010070104

Chicago

Feng, Wangsen, and Lusheng Wang. "Identification of Distinguishing Motifs," International Journal of Knowledge Discovery in Bioinformatics (IJKDB) 1, no.3: 53-67. http://doi.org/10.4018/jkdb.2010070104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Motif identification for DNA sequences has many important applications in biological studies, including diagnostic probe design, locating binding sites and regulatory signals, and potential drug target identification. There are two versions—the Single Group and Two Groups. Here, the occurrences of the motif in the given sequences have errors. Currently, most of existing programs can only handle the case of single group. However, most of the programs do not allow indels (insertions and deletions) in the occurrences of the motif. In this paper, the authors propose a randomized algorithm for the one group problem that can handle indels in the occurrences of the motif. Finally, an algorithm for the two groups’ problem is given along with extensive simulations evaluating algorithms.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.