Stefan Canzar

According to our database1, Stefan Canzar authored at least 33 papers between 2006 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




Anti Tai Mapping for Unordered Labeled Trees.
CoRR, 2021

BiCoN: network-constrained biclustering of patients and omics data.
Bioinform., 2021

Chromatyping: Reconstructing Nucleosome Profiles from NOMe Sequencing Data.
J. Comput. Biol., 2020

Exploring the functional impact of alternative splicing on human protein isoforms using available annotation sources.
Briefings Bioinform., 2019

Dynamic Pseudo-time Warping of Complex Single-Cell Trajectories.
Proceedings of the Research in Computational Molecular Biology, 2019

Properties of the generalized Robinson-Foulds metric.
Proceedings of the 42nd International Convention on Information and Communication Technology, 2019

On the approximability of the maximum interval constrained coloring problem.
Discret. Optim., 2018

Short Read Mapping: An Algorithmic Tour.
Proc. IEEE, 2017

BASIC: BCR assembly from single cells.
Bioinform., 2017

Resolving Conflicting Predictions from Multimapping Reads.
J. Comput. Biol., 2016

ModuleAlign: module-based global alignment of protein-protein interaction networks.
Bioinform., 2016

On Tree-Constrained Matchings and Generalizations.
Algorithmica, 2015

CIDANE: Comprehensive Isoform Discovery and Abundance Estimation.
Proceedings of the Research in Computational Molecular Biology, 2015

A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem.
ACM J. Exp. Algorithmics, 2013

Charge Group Partitioning in Biomolecular Simulation.
J. Comput. Biol., 2013

The Duplication-Loss Small Phylogeny Problem: From Cherries to Trees.
J. Comput. Biol., 2013

GAGE-B: an evaluation of genome assemblers for bacterial organisms.
Bioinform., 2013

The Generalized Robinson-Foulds Metric.
Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

A Branch-and-Cut Algorithm for the 2-Species Duplication-Loss Phylogeny Problem
CoRR, 2012

CLEVER: clique-enumerating variant finder.
Bioinform., 2012

Charge Group Partitioning in Biomolecular Simulation.
Proceedings of the Research in Computational Molecular Biology, 2012

Solving the Minimum String Cover Problem.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

An exact algorithm for side-chain placement in protein design.
Optim. Lett., 2011

Approximation Algorithms for the Interval Constrained Coloring Problem.
Algorithmica, 2011

A Mathematical Programming Approach to Marker-Assisted Gene Pyramiding.
Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011

Computing H/D-Exchange rates of single residues from data of proteolytic fragments.
BMC Bioinform., 2010

Discrete Fitting of Hydrogen-Deuterium-Exchange-data of Overlapping Fragments.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2009

Lagrangian Relaxation - Solving NP-hard Problems in Computational Biology via Combinatorial Optimization.
PhD thesis, 2008

A Lagrangian relaxation approach for the multiple sequence alignment problem.
J. Comb. Optim., 2008

Approximating the Interval Constrained Coloring Problem.
Proceedings of the Algorithm Theory, 2008

Computing H/D-exchange speeds of single residues from data of peptic fragments.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

LASA: A Tool for Non-heuristic Alignment of Multiple Sequences.
Proceedings of the Bioinformatics Research and Development, 2008

Shape Distributions and Protein Similarity.
Proceedings of the German Conference on Bioinformatics GCB 2006, 19.09. 2006, 2006