default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimothy L. Bailey
- > Home > Persons > Timothy L. Bailey
Publications
- 2019
[j43]Alice Cheng, Charles E. Grant, William S. Noble
, Timothy L. Bailey:
MoMo: discovery of statistically significant post-translational modification motifs. Bioinform. 35(16): 2774-2782 (2019)- 2016
- [j42]Charles E. Grant, James Johnson, Timothy L. Bailey, William Stafford Noble:
MCAST: scanning for cis-regulatory motif clusters. Bioinform. 32(8): 1217-1219 (2016) - 2015
- [j41]Timothy L. Bailey, James Johnson, Charles E. Grant, William S. Noble:
The MEME Suite. Nucleic Acids Res. 43(Webserver-Issue): W39-W49 (2015) - 2012
- [j36]Gabriel Cuéllar-Partida, Fabian A. Buske, Robert C. McLeay, Tom Whitington, William Stafford Noble, Timothy L. Bailey:
Epigenetic priors for identifying active transcription factor binding sites. Bioinform. 28(1): 56-62 (2012) - 2011
- [j33]Charles E. Grant, Timothy L. Bailey, William Stafford Noble:
FIMO: scanning for occurrences of a given motif. Bioinform. 27(7): 1017-1018 (2011) - [j31]Emi Tanaka, Timothy L. Bailey, Charles E. Grant, William Stafford Noble, Uri Keich:
Improved similarity scores for comparing motifs. Bioinform. 27(12): 1603-1609 (2011) - 2009
- [j20]John Hawkins, Charles E. Grant, William Stafford Noble, Timothy L. Bailey:
Assessing phylogenetic motif models for predicting transcription factor binding sites. Bioinform. 25(12) (2009) - [j18]Timothy L. Bailey, Mikael Bodén, Fabian A. Buske, Martin C. Frith, Charles E. Grant, Luca Clementi, Jingyuan Ren, Wilfred W. Li, William Stafford Noble:
MEME SUITE: tools for motif discovery and searching. Nucleic Acids Res. 37(Web-Server-Issue): 202-208 (2009) - 2003
- [c6]Timothy L. Bailey, William Stafford Noble:
Searching for statistically significant regulatory modules. ECCB 2003: 16-25 - 1999
- [j7]William Noble Grundy, Timothy L. Bailey:
Family pairwise search with embedded motif models. Bioinform. 15(6): 463-470 (1999) - [c5]Timothy L. Bailey, William Noble Grundy:
Classifying proteins by family using the product of correlated p-values. RECOMB 1999: 10-14 - [p1]Timothy L. Bailey, Michael E. Baker, Charles Elkan, William Noble Grundy:
MEME, MAST, and Meta-MEME: New Tools for Motif Discovery in Protein Sequences. Pattern Discovery in Biomolecular Data 1999: 30-54 - 1997
- [j4]William Noble Grundy, Timothy L. Bailey, Charles Elkan, Michael E. Baker:
Meta-MEME: motif-based hidden Markov models of protein families. Comput. Appl. Biosci. 13(4): 397-406 (1997) - 1996
- [j2]William Noble Grundy, Timothy L. Bailey, Charles Elkan:
ParaMEME: a parallel implementation and a web interface for a DNA and protein motif discovery tool. Comput. Appl. Biosci. 12(4): 303-310 (1996)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
