|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2009 IEEE International Conference on Bioinformatics and Biomedicine Workshop
Identification of structured motifs
Washington, DC USA
November 01-November 04
ISBN: 978-1-4244-5121-0
| ASCII Text | x | ||
| Huitao Sheng, K. Mehrotra, C. Mohan, R. Raina, "Identification of structured motifs," 2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops, pp. 249-253, 2009 IEEE International Conference on Bioinformatics and Biomedicine Workshop, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/BIBMW.2009.5332103, author = { Huitao Sheng and K. Mehrotra and C. Mohan and R. Raina}, title = {Identification of structured motifs}, journal ={2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops}, volume = {0}, year = {2009}, isbn = {978-1-4244-5121-0}, pages = {249-253}, doi = {http://doi.ieeecomputersociety.org/10.1109/BIBMW.2009.5332103}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops TI - Identification of structured motifs SN - 978-1-4244-5121-0 SP249 EP253 A1 - Huitao Sheng, A1 - K. Mehrotra, A1 - C. Mohan, A1 - R. Raina, PY - 2009 KW - gap length KW - structured motifs KW - nucleotides KW - motif searching algorithm KW - half-sites VL - 0 JA - 2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops ER - | |||
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.
Index Terms:
gap length, structured motifs, nucleotides, motif searching algorithm, half-sites
Citation:
Huitao Sheng, K. Mehrotra, C. Mohan, R. Raina, "Identification of structured motifs," bibmw, pp.249-253, 2009 IEEE International Conference on Bioinformatics and Biomedicine Workshop, 2009
Usage of this product signifies your acceptance of the Terms of Use.