A polynomial delay algorithm for enumerating approximate solutions to the interval Constrained Coloring problem

2010 Proceedings of the 12th Workshop on Algorithm Engineering and Experiments, ALENEX 2010

Volumn , Issue , 2010, Pages 23-33

  Canzar, Stefan ^a   Elbassioni, Khaled ^b   Mestre, Julián ^b  

^a CWI   (Netherlands)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; MASS SPECTROMETRY; PROTEINS;

ACCUMULATIVE ERRORS; ALGORITHMIC FRAMEWORK; APPROXIMATE SOLUTION; COMBINATORIAL PROBLEM; INTERPRETATION OF DATA; POLYNOMIAL DELAYS; PROTEIN STRUCTURES; SPATIAL RESOLUTION;

POLYNOMIALS;

EID: 78650895998     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972900.3     Document Type: Conference Paper

References (14)

1. Ernst Althaus, Stefan Canzar, Carsten Ehrler, Mark R. Emmett, Andreas Karrenbauer, Alan G. Marshall, Anke Meyer-B̈ase, Jeremiah Tipton, and Huimin Zhang. Discrete fitting of hydrogen-deuterium-exchange-data of overlapping fragments. In Proceedings of the 4th In- ternational Conference on Bioinformatics & Computa tional Biology, pages 23{30, 2009.
2. Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, and Julia'n Mestre. Approximating the interval constrained coloring problem. In Proceedings of the 11th Scandinavian Workshop on Al- gorithm Theory, pages 210{221, 2008.
3. Ernst Althaus, Stefan Canzar, Mark R. Emmett, Andreas Karrenbauer, Alan G. Marshall, Anke Meyer- Bäse, and Huimin Zhang. Computing h/d-exchange speeds of single residues from data of peptic fragments. In Proceedings of the 23rd Annual ACM Symposium on Applied Computing, pages 1273{1277, 2008.
4. M. R. Bussieck and M. E. Lübbecke. The vertex set of a 0/1 polytope is strongly P-enumerable. Computational Geometry, 11(2):103{109, 1998.
5. Jarek Byrka, Andreas Karrebauer, and Laura Sanit̀a. Hardness of interval constrained coloring. In Proceed- ings of the 9th Latin American Theoretical Informatics Symposium, 2009.
6. S. Canzar. Lagrangian Relaxation- Solving NP-hard problems in Computational Biology via Combinatorial Optimization. PhD thesis, Universitat des Saarlandes, 2008.
7. S. W. Englander. Hydrogen exchange and mass spectrometry: A historical perspective. J. Am. Soc. Mass. Spectrom., 17(11):1481{1489, 2006.
8. Fred Glover. Maximum matching in a convex bipartite graph. Naval Research Logistics Quarterly, 14(3):313{ 316, 1967.
9. Christian Komusiewicz, Rolf Niedermeier, and Johannes Uhlmann. Deconstructing intractability: A case study for interval constrained coloring. In Prceedings of the 20th Annual Symposium on Combinatorial Pattern Matching, pages 207{220, 2009.
10. J.F. Leite and M. Cascio. Probing the topology of the glycine receptor by chemical modiffication coupled to mass spectrometry. Biochemistry, 41(19):6140{6148, 2002.
11. A. Schrijver. Combinatorial Optimization: Polyhedra and Effciency, Algorithms and Combinatorics, volume 24. Springer, New York, 2003.
12. J.S. Sharp, J.M. Becker, and R.L. Hettich. Analysis of protein solvent accessible surfaces by photochemical oxidation and mass spectrometry. Analytical Chemistry, 76(3):672{683, 2004.
13. Z. Zhang, W. Li, T. M. Logan, M. Li, and A. G. Marshall. Human recombinant[C22A] FK506-binding protein amide hydrogen exchange rates from mass spectrometry match and extend those from NMR. Protein Sci., 6(10):2203{2217, 1997.
14. E.R.P. Zuiderweg. Mapping protein-protein interactions in solution by nmr spectroscopy. Biochemistry, 41(1):1{7, 2002.