Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Approximating the Interval Constrained Coloring Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences
A faster algorithm for finding minimum tucker submatrices
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
Journal of Discrete Algorithms
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
The interval constrained 3-coloring problem
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Hi-index | 0.00 |
Determining the hydrogen-deuterium exchange speeds of single residues from data for peptic fragments obtained by FT-ICS MS is currently mainly done by manual interpretation. We provide an automated method based on combinatorial optimization. More precisely, we present an algorithm that enumerates all possible exchange speeds for single residues that explain the observed data of the peptic fragments.