• contact information
• research
• about me

US Mail:                                            Email: [account:abrady] [server:umiacs d0t umd d0t edu]
Center for Bioinformatics and Computational Biology               
3104D Biomolecular Sciences Building (Building #296)               
University of Maryland                               Phone: three oh one four oh five eight seven seven two
College Park, MD 20742
U.S.A.                           

I'm a postdoctoral research associate at CBCB; my current area of study is eukaryotic gene finding.

This section should be expanded soon; I've just started at CBCB. ;-)
 
Publications

• A. Brady, K. Maxwell, N. Daniels, L. Cowen
  Fault tolerance in protein interaction networks: stable bipartite subgraphs and redundant pathways
  (submitted for publication)
• A. Brady
  Detecting high-level gene function and inferring genetic pathway relationships using machine learning methods
  Doctoral dissertation, Tufts University Department of Computer Science, July 2008
• X. Wei, L. Cowen, C. Brodley, A. Brady, D Sculley and D. Slonim
  A distance-based method for detecting horizontal gene transfer in whole genomes
  Proceedings of the 4th International Symposium on Bioinformatics Research and Applications
  (ISBRA 2008)
   
• D. Krioukov, kc claffy, K. Fall, A. Brady
  On compact routing for the Internet
  ACM SIGCOMM Computer Communication Review, Vol. 37, Issue 3 (July 2007)
  pp. 41-52
   
• A. Brady, L. Cowen
  Exact distance labelings yield additive-stretch compact routing schemes
  Winner, Best Student Paper Award
  Proceedings of the 20th International Symposium on Distributed Computing
  (DISC 2006), pp. 339-354
   
• A. Brady, L. Cowen
  Brief Announcement: Compact routing with additive stretch using distance labelings
  Proceedings of the 18th ACM Symposium on Parallelism in Algorithms and Architectures
  (SPAA 2006), p. 233
   
• A. Brady, L. Cowen
  Compact routing on power-law graphs with additive stretch
  Proceedings of the 8th Workshop on Algorithm Engineering and Experiments
  (ALENEX 2006), pp. 119-128
   
• A. Brady
  A compact routing scheme for power-law networks using empirical discoveries in power-law graph topology
  Master's thesis, Tufts University Department of Computer Science, May 2005

I was born and raised in New York, on the east bank of the Hudson River. Some time later, I graduated from Johns Hopkins University in Baltimore, with undergraduate majors in CS and psych. I worked for several years, ranging across small business and megalithic media conglomerate computer programming, developing web and database applications, doing system administration, and writing standalone applications to help other people make lots and lots of money. I goggled in wonder for a while at the bliss and miracle of the American Dream - i.e., wedging myself into a lucrative and secure niche in the mind-numbing, tope-colored, passive-aggressive, soul-killing Office Space Hellscape that is Corporation, U.S.A., then promptly dropped out (on purpose!), went to Tufts in August 2002 to turn on to a graduate career in theoretical computer science. (PhD now complete; the "theoretical" part got altered along the way to "massively applied." =) I'm now working as a postdoc at the Center for Bioinformatics and Computational Biology (CBCB) at the University of Maryland, College Park. Feel free to tune in to see how it's all going.

Please note that the general layout of this page has been shamelessly stolen from Lenore Cowen [discounting a few minor stylistic modifications]. If you want to look at my never-to-not-be-under-construction attempt at actual web design, I might show it to you sometime. Should you find it, note that UMD and CBCB are of course not responsible for anything there you might manage to offend yourself with, etc., blah, etc., yadda blah blah.