Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Christina Boucher
2010 – today
- 2012
[j4]Roy Ronen, Christina Boucher, Hamidreza Chitsaz, Pavel A. Pevzner: SEQuel: improving the accuracy of genome assemblies. Bioinformatics 28(12): 188-196 (2012)
[j3]Christina Boucher, Mohamed Omar: On the Hardness of Counting and Sampling Center Strings. IEEE/ACM Trans. Comput. Biology Bioinform. 9(6): 1843-1846 (2012)
[c10]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann: On Approximating String Selection Problems with Outliers. CPM 2012: 427-438
[i2]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann: On Approximating String Selection Problems with Outliers. CoRR abs/1202.2820 (2012)- 2011
[j2]
[c9]Christina Boucher: The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity. MFCS 2011: 158-169
[i1]Christina Boucher, Christine Lo, Daniel Lokshtanov: Outlier Detection for DNA Fragment Assembly. CoRR abs/1111.0376 (2011)- 2010
[j1]Christina Boucher, James King: Fast motif recognition via application of statistical thresholds. BMC Bioinformatics 11(S-1): 11 (2010)
[c8]Christina Boucher, Kathleen Wilkie: Why Large Closest String Instances Are Easy to Solve in Practice. SPIRE 2010: 106-117
[c7]Christina Boucher, Mohamed Omar: On the Hardness of Counting and Sampling Center Strings. SPIRE 2010: 127-134
2000 – 2009
- 2009
[c6]Christina Boucher, Daniel G. Brown: Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding. BICoB 2009: 139-150
[c5]Christina Boucher: Faster Algorithms for Sampling and Counting Biological Sequences. SPIRE 2009: 243-253- 2008
[c4]Christina Boucher, Daniel G. Brown, Stephane Durocher: On the Structure of Small Motif Recognition Instances. SPIRE 2008: 269-281- 2007
[c3]Maja Omanovic, Christina Boucher: An Ant Colony Optimization Heuristic for the Combinatorial Auction Problem. IC-AI 2007: 176-184
[c2]
[c1]Christina Boucher, Daniel G. Brown, Paul Church: A Graph Clustering Approach to Weak Motif Recognition. WABI 2007: 149-160
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-26 04:07 CET by the dblp team



