 | 2012 |
|---|
| 12 |       | Christina Boucher,
Gad M. Landau,
Avivit Levy,
David Pritchard,
Oren Weimann:
On Approximating String Selection Problems with Outliers
CoRR abs/1202.2820: (2012) |
| 2011 |
|---|
| 11 | | Christina Boucher:
The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity.
MFCS 2011: 158-169 |
| 10 | | Christina Boucher,
Christine Lo,
Daniel Lokshtanov:
Outlier Detection for DNA Fragment Assembly
CoRR abs/1111.0376: (2011) |
| 2010 |
|---|
| 9 | | Christina Boucher,
Kathleen Wilkie:
Why Large Closest String Instances Are Easy to Solve in Practice.
SPIRE 2010: 106-117 |
| 8 | | Christina Boucher,
Mohamed Omar:
On the Hardness of Counting and Sampling Center Strings.
SPIRE 2010: 127-134 |
| 7 | | Christina Boucher,
James King:
Fast motif recognition via application of statistical thresholds.
BMC Bioinformatics 11(S-1): 11 (2010) |
| 2009 |
|---|
| 6 | | Christina Boucher,
Daniel G. Brown:
Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding.
BICoB 2009: 139-150 |
| 5 | | Christina Boucher:
Faster Algorithms for Sampling and Counting Biological Sequences.
SPIRE 2009: 243-253 |
| 2008 |
|---|
| 4 | | Christina Boucher,
Daniel G. Brown,
Stephane Durocher:
On the Structure of Small Motif Recognition Instances.
SPIRE 2008: 269-281 |
| 2007 |
|---|
| 3 |  | Maja Omanovic,
Christina Boucher:
An Ant Colony Optimization Heuristic for the Combinatorial Auction Problem.
IC-AI 2007: 176-184 |
| 2 | | Christina Boucher,
Maja Omanovic:
A Graphical Game Model of Drug Binding.
IC-AI 2007: 621-627 |
| 1 | | Christina Boucher,
Daniel G. Brown,
Paul Church:
A Graph Clustering Approach to Weak Motif Recognition.
WABI 2007: 149-160 |
Data released under the ODC-BY 1.0 license — See also our legal information page