| 2013 | ||
|---|---|---|
| j6 | Stefan Canzar, Mohammed El-Kebir, René Pool, Khaled M. Elbassioni, Alan E. Mark, Daan P. Geerke, Leen Stougie, Gunnar W. Klau: Charge Group Partitioning in Biomolecular Simulation. Journal of Computational Biology 20(3): 188-198 (2013) | |
| 2012 | ||
| j5 | Tobias Marschall, Ivan G. Costa, Stefan Canzar, Markus Bauer, Gunnar W. Klau, Alexander Schliep, Alexander Schönhuth: CLEVER: clique-enumerating variant finder. Bioinformatics 28(22): 2875-2882 (2012) | |
| c12 | Stefan Canzar, Tobias Marschall, Sven Rahmann, Chris Schwiegelshohn: Solving the Minimum String Cover Problem. ALENEX 2012: 75-83 | |
| c11 | Stefan Canzar, Mohammed El-Kebir, René Pool, Khaled M. Elbassioni, Alpeshkumar K. Malde, Alan E. Mark, Daan P. Geerke, Leen Stougie, Gunnar W. Klau: Charge Group Partitioning in Biomolecular Simulation. RECOMB 2012: 29-43 | |
| i2 | Stefan Canzar, Sandro Andreotti: A Branch-and-Cut Algorithm for the 2-Species Duplication-Loss Phylogeny Problem. CoRR abs/1208.2698 (2012) | |
| 2011 | ||
| j4 | Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre: Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica 61(2): 342-361 (2011) | |
| j3 | Stefan Canzar, Nora C. Toussaint, Gunnar W. Klau: An exact algorithm for side-chain placement in protein design. Optimization Letters 5(3): 393-406 (2011) | |
| c10 | Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julián Mestre: On Tree-Constrained Matchings and Generalizations. ICALP (1) 2011: 98-109 | |
| c9 | Stefan Canzar, Mohammed El-Kebir: A Mathematical Programming Approach to Marker-Assisted Gene Pyramiding. WABI 2011: 26-38 | |
| i1 | Stefan Canzar, Nora C. Toussaint, Gunnar W. Klau: An Exact Algorithm for Side-Chain Placement in Protein Design. CoRR abs/1103.1503 (2011) | |
| 2010 | ||
| j2 | Ernst Althaus, Stefan Canzar, Carsten Ehrler, Mark R. Emmett, Andreas Karrenbauer, Alan G. Marshall, Anke Meyer-Bäse, Jeremiah D. Tipton, Huimin Zhang: Computing H/D-Exchange rates of single residues from data of proteolytic fragments. BMC Bioinformatics 11: 424 (2010) | |
| c8 | Stefan Canzar, Khaled M. Elbassioni, Julián Mestre: A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem. ALENEX 2010: 23-33 | |
| c7 | Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman: On the Approximability of the Maximum Interval Constrained Coloring Problem. ISAAC (2) 2010: 168-179 | |
| 2009 | ||
| c6 | Ernst Althaus, Stefan Canzar, Carsten Ehrler, Mark R. Emmett, Andreas Karrenbauer, Alan G. Marshall, Anke Meyer-Bäse, Jeremiah Tiptopn, Huimin Zhang: Discrete Fitting of Hydrogen-Deuterium-Exchange-data of Overlapping Fragments. BIOCOMP 2009: 496-502 | |
| 2008 | ||
| j1 | Ernst Althaus, Stefan Canzar: A Lagrangian relaxation approach for the multiple sequence alignment problem. J. Comb. Optim. 16(2): 127-154 (2008) | |
| c5 | Ernst Althaus, Stefan Canzar: LASA: A Tool for Non-heuristic Alignment of Multiple Sequences. BIRD 2008: 489-498 | |
| c4 | Ernst Althaus, Stefan Canzar, Mark R. Emmett, Andreas Karrenbauer, Alan G. Marshall, Anke Meyer-Bäse, Huimin Zhang: Computing H/D-exchange speeds of single residues from data of peptic fragments. SAC 2008: 1273-1277 | |
| c3 | Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre: Approximating the Interval Constrained Coloring Problem. SWAT 2008: 210-221 | |
| 2007 | ||
| c2 | Ernst Althaus, Stefan Canzar: A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem. COCOA 2007: 267-278 | |
| 2006 | ||
| c1 | Stefan Canzar, Jan Remy: Shape Distributions and Protein Similarity. German Conference on Bioinformatics 2006: 1-10 | |
Data released under the ODC-BY 1.0 license — See also our legal information page