 | 2009 |
| 12 |  | Atsushi Niida,
Andrew D. Smith,
Seiya Imoto,
Hiroyuki Aburatani,
Michael Q. Zhang,
Tetsu Akiyama:
Gene set-based module discovery in the breast cancer transcriptome.
BMC Bioinformatics 10: (2009) |
| 2008 |
| 11 |  | Atsushi Niida,
Andrew D. Smith,
Seiya Imoto,
Shuichi Tsutsumi,
Hiroyuki Aburatani,
Michael Q. Zhang,
Tetsu Akiyama:
Integrative bioinformatics analysis of transcriptional regulatory programs in breast cancer cells.
BMC Bioinformatics 9: (2008) |
| 10 |  | Andrew D. Smith,
Zhenyu Xuan,
Michael Q. Zhang:
Using quality scores and longer reads improves accuracy of Solexa read mapping.
BMC Bioinformatics 9: (2008) |
| 2007 |
| 9 |  | Dustin E. Schones,
Andrew D. Smith,
Michael Q. Zhang:
Statistical significance of cis-regulatory modules.
BMC Bioinformatics 8: (2007) |
| 8 |  | M. Juanita Martinez,
Andrew D. Smith,
Bilan Li,
Michael Q. Zhang,
Kevin S. Harrod:
Computational prediction of novel components of lung transcriptional networks.
Bioinformatics 23(1): 21-29 (2007) |
| 2005 |
| 7 |  | Andrew D. Smith,
Pavel Sumazin,
Debopriya Das,
Michael Q. Zhang:
Mining ChIP-chip data for transcription factor and cofactor binding sites.
ISMB (Supplement of Bioinformatics) 2005: 403-412 |
| 6 |  | Andy Pang,
Andrew D. Smith,
Paulo A. S. Nuin,
Elisabeth R. M. Tillier:
SIMPROT: Using an empirically determined indel distribution in simulations of protein evolution.
BMC Bioinformatics 6: 236 (2005) |
| 5 |  | Pavel Sumazin,
Gengxin Chen,
Naoya Hata,
Andrew D. Smith,
Theresa Zhang,
Michael Q. Zhang:
DWE: Discriminating Word Enumerator.
Bioinformatics 21(1): 31-38 (2005) |
| 2003 |
| 4 |  | Patricia A. Evans,
Andrew D. Smith:
Complexity of Approximating Closest Substring Problems.
FCT 2003: 210-221 |
| 3 |  | Patricia A. Evans,
Andrew D. Smith:
Toward Optimal Motif Enumeration.
WADS 2003: 47-58 |
| 2 |  | Shalini Veerassamy,
Andrew D. Smith,
Elisabeth R. M. Tillier:
A Transition Probability Model for Amino Acid Substitutions from Blocks.
Journal of Computational Biology 10(6): 997-1010 (2003) |
| 1 |  | Patricia A. Evans,
Andrew D. Smith,
Harold T. Wareham:
On the complexity of finding common approximate substrings.
Theor. Comput. Sci. 306(1-3): 407-430 (2003) |