Identification of structured motifs

Huitao Sheng, Kishan Mehrotra, Chilukuri K Mohan, Ramesh Raina

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Structured motifs consist of two simpler patterns (half-sites) separated from each other by a gap, with no restriction on the nucleotides that may occur within the gap. This paper proposes a new algorithm to identify structured motifs. First, a simpler motif searching algorithm is used to search for half-sites. Candidate structured motif models are then evaluated, based on the relative frequency of occurrence of half-sites (not attributable to randomness), and the distribution of gap length. Unlike other recent structured motif detection algorithms, the new algorithm does not require the gap length to be prespecified.

Original languageEnglish (US)
Title of host publicationProceedings - 2009 IEEE International Conference on Bioinformatics and Biomedicine Workshops, BIBMW 2009
Pages249-253
Number of pages5
DOIs
StatePublished - 2009
Event2009 IEEE International Conference on Bioinformatics and Biomedicine Workshops, BIBMW 2009 - Washington, DC, United States
Duration: Nov 1 2009Nov 4 2009

Other

Other2009 IEEE International Conference on Bioinformatics and Biomedicine Workshops, BIBMW 2009
CountryUnited States
CityWashington, DC
Period11/1/0911/4/09

Fingerprint

Nucleotides

ASJC Scopus subject areas

  • Biomedical Engineering
  • Health Informatics
  • Health Information Management

Cite this

Sheng, H., Mehrotra, K., Mohan, C. K., & Raina, R. (2009). Identification of structured motifs. In Proceedings - 2009 IEEE International Conference on Bioinformatics and Biomedicine Workshops, BIBMW 2009 (pp. 249-253). [5332103] https://doi.org/10.1109/BIBMW.2009.5332103

Identification of structured motifs. / Sheng, Huitao; Mehrotra, Kishan; Mohan, Chilukuri K; Raina, Ramesh.

Proceedings - 2009 IEEE International Conference on Bioinformatics and Biomedicine Workshops, BIBMW 2009. 2009. p. 249-253 5332103.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sheng, H, Mehrotra, K, Mohan, CK & Raina, R 2009, Identification of structured motifs. in Proceedings - 2009 IEEE International Conference on Bioinformatics and Biomedicine Workshops, BIBMW 2009., 5332103, pp. 249-253, 2009 IEEE International Conference on Bioinformatics and Biomedicine Workshops, BIBMW 2009, Washington, DC, United States, 11/1/09. https://doi.org/10.1109/BIBMW.2009.5332103
Sheng H, Mehrotra K, Mohan CK, Raina R. Identification of structured motifs. In Proceedings - 2009 IEEE International Conference on Bioinformatics and Biomedicine Workshops, BIBMW 2009. 2009. p. 249-253. 5332103 https://doi.org/10.1109/BIBMW.2009.5332103
Sheng, Huitao ; Mehrotra, Kishan ; Mohan, Chilukuri K ; Raina, Ramesh. / Identification of structured motifs. Proceedings - 2009 IEEE International Conference on Bioinformatics and Biomedicine Workshops, BIBMW 2009. 2009. pp. 249-253
@inproceedings{735b5b26c0564ff5a15a60ed22cf3bce,
title = "Identification of structured motifs",
abstract = "Structured motifs consist of two simpler patterns (half-sites) separated from each other by a gap, with no restriction on the nucleotides that may occur within the gap. This paper proposes a new algorithm to identify structured motifs. First, a simpler motif searching algorithm is used to search for half-sites. Candidate structured motif models are then evaluated, based on the relative frequency of occurrence of half-sites (not attributable to randomness), and the distribution of gap length. Unlike other recent structured motif detection algorithms, the new algorithm does not require the gap length to be prespecified.",
author = "Huitao Sheng and Kishan Mehrotra and Mohan, {Chilukuri K} and Ramesh Raina",
year = "2009",
doi = "10.1109/BIBMW.2009.5332103",
language = "English (US)",
isbn = "9781424451210",
pages = "249--253",
booktitle = "Proceedings - 2009 IEEE International Conference on Bioinformatics and Biomedicine Workshops, BIBMW 2009",

}

TY - GEN

T1 - Identification of structured motifs

AU - Sheng, Huitao

AU - Mehrotra, Kishan

AU - Mohan, Chilukuri K

AU - Raina, Ramesh

PY - 2009

Y1 - 2009

N2 - Structured motifs consist of two simpler patterns (half-sites) separated from each other by a gap, with no restriction on the nucleotides that may occur within the gap. This paper proposes a new algorithm to identify structured motifs. First, a simpler motif searching algorithm is used to search for half-sites. Candidate structured motif models are then evaluated, based on the relative frequency of occurrence of half-sites (not attributable to randomness), and the distribution of gap length. Unlike other recent structured motif detection algorithms, the new algorithm does not require the gap length to be prespecified.

AB - Structured motifs consist of two simpler patterns (half-sites) separated from each other by a gap, with no restriction on the nucleotides that may occur within the gap. This paper proposes a new algorithm to identify structured motifs. First, a simpler motif searching algorithm is used to search for half-sites. Candidate structured motif models are then evaluated, based on the relative frequency of occurrence of half-sites (not attributable to randomness), and the distribution of gap length. Unlike other recent structured motif detection algorithms, the new algorithm does not require the gap length to be prespecified.

UR - http://www.scopus.com/inward/record.url?scp=72849143272&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=72849143272&partnerID=8YFLogxK

U2 - 10.1109/BIBMW.2009.5332103

DO - 10.1109/BIBMW.2009.5332103

M3 - Conference contribution

AN - SCOPUS:72849143272

SN - 9781424451210

SP - 249

EP - 253

BT - Proceedings - 2009 IEEE International Conference on Bioinformatics and Biomedicine Workshops, BIBMW 2009

ER -