10.01.2012 Member of the CPM 2013 Program Committee. 

08.01.2012 Website is updated to reflect my new status as an Assistant Professor at Colorado State University. 

07.17.2012 SEQuel paper is presented at ISMB 2012.

07.05.2012 "On Approximating String Selection Problems with Outliers" is presented at CPM 2012.

Intrested in Grad School?

I am looking for highly motivated students.

Contact Me

christinaboucher.jpg

I am an Assistant Professor at the Department of Computer Science at Colorado State University in Fort Collins, Colorado. Prior to joining the faculty at Colorado State University, I worked as a Post-Doctoral Researcher at the University of California, San Diego in Pavel Pevzner's lab. In November 2010, I received my doctorate degree in Computer Science from the University of Waterloo under the supervision of Ming Li and Prabhakar Ragde

My research aims to design and implement efficient algorithms that solve computational problems in genomics and transcriptomics.  I frequently collaborate with biologists, mathematicians and clinician scientists in the tool development in order to ensure their practical application. 

My research efforts have been recognized in the way of research fellowships and awards from the following granting agencies: NSERC: The Natural Science and Engineering Research Council of Canada, Google, and GO-Bell. For more information about some of my research projects visit my research page.

On the hardness of counting and sampling center strings.

Boucher, C. and Omar, M. To appear in IEEE/ACM Transactions on Computational Biology and Bioinformatics. Conference version in the proceedings of the 17th Annual Symposium on String Processing and Information Retrieval (SPIRE 2010), pages 128--135.

SEQuel: improving the accuracy of genome assemblies

R. Ronen*, C. Boucher*, H. Chitsaz, and P. Pevzner. SEQuel: Improving the Accuracy of Genome Assemblies. Accepted to ISMB 2012. Bioinformatics (2012) 28 (12): i188-i196.

On Approximating String Selection Problems with Outliers.

C. Boucher, G. Landau, A. Levy, D. Pritchard, and O. Weimann. On Approximating String Selection Problems with Outliers. In proceedings of the 23rd Annual Combinatorial Pattern Matching (CPM 2012), pages 427--438.

Suggested curriculum and teaching ideas for incorporating bioinformatics into secondary biology education.

C. Boucher and N. Castellana Suggested curriculum and teaching ideas for incorporating bioinformatics into secondary biology education. RECOMB Satellite Conference on Bioinformatics Education (RECOMB-BE 2011).

The Bounded Search Tree Algorithm for the Closest String Problem has Quadratic Smoothed Complexity.

C. Boucher. The Bounded Search Tree Algorithm for the Closest String Problem has Quadratic Smoothed Complexity. In proceedings of the 36th Annual Mathematical Foundations of Computer Science (MFCS 2011), pages 158--169.

View all publications >>