Browse by Authors

2011

Bielow, C. and Gröpl, C. and Kohlbacher, O. and Reinert, K. (2011) Bioinformatics for qualitative and quantitative proteomics. In: Bioinformatics for Omics Data Methods and Protocols. Humana Press, pp. 331-49.

2008

Schulz-Trieglaff, O. and Hussong, R. and Gröpl, C. and Hildebrandt, A. and Hildebrandt, A. and Huber, Ch. and Reinert, K. (2008) Computational Quantification of Peptides from LC-MS data. Journal of Computational Biology, 15 (7). pp. 685-704.

Lange, E. and Tautenhahn, R. and Neumann, S. and Gröpl, C. (2008) Critical assessment of alignment procedures for LC-MS proteomics and metabolomic measurements. BMC Bioinformatics, 9 (375).

Bodirsky, M. and Gröpl, C. and Kang, M. (2008) Generating unlabeled connected cubic planar graphs uniformly at random. Random Structures and Algorithms, 32 (2). pp. 157-180.

Schulz-Trieglaff, O. and Pfeifer, N. and Gröpl, C. and Kohlbacher, O. and Reinert, K. (2008) LC-MSsim - a simulation software for liquid chromatography mass spectrometry data. BMC Bioinformatics, 9 (423).

Sturm, M. and Andreas, B. and Gröpl, C. and Hussong, R. and Lange, E. and Pfeifer, N. and Schulz-Trieglaff, O. and Zerck, A. and Reinert, K. and Kohlbacher, O. (2008) OpenMS - An open-source software framework for mass spectrometry. BMC Bioinformatics, 9 (163).

2007

Schulz-Trieglaff, O. and Hussong, R. and Gröpl, C. and Hildebrandt, A. and Reinert, K. (2007) A Fast and Accurate Algorithm for the Quantification of Peptides from Mass Spectrometry data. In: Proceedings of the Eleventh Annual International Conference on Research in Computational Molecular Biology (RECOMB 2007).

Bodirsky, M. and Gröpl, C. and Kang, M. (2007) Generating labeled planar graphs uniformly at random. Theoretical Computer Science, 379 (3). pp. 377-386.

Lange, E. and Gröpl, C. and Schulz-Trieglaff, O. and Leinenbach, A. and Huber, Ch. and Reinert, K. (2007) A Geometric Approach for the Alignment of Liquid Chromatography-Mass Spectrometry Data. Oxford Journals, 23 (13). i273-i281. ISSN 1460-2059 (online), 1367-4803 (print)

Bodirsky, M. and Gröpl, C. and Johannsen, D. and Kang, M. (2007) A direct decomposition of 3-connected planar graphs. Séminaire Lotharingien de Combinatoire, B54Ak . 15 pages.

2006

Mayr, B. M. and Kohlbacher, O. and Reinert, K. and Gröpl, C. and Lange, E. and Klein, C. L. and Huber, Ch. (2006) Absolute Myoglobin Quantitation in Serum by Combining Two-Dimensional Liquid Chromatography-Electrospray Ionization Mass Spectrometry and Novel Data Analysis Algorithms. Journal of Proteome Research, 5 . pp. 414-421.

Lange, E. and Gröpl, C. and Reinert, K. and Hildebrandt, A. (2006) High Accuracy Peak-Picking of Proteomics Data using Wavelet Techniques. In: Proceedings of the 11th Pacific Symposium on Biocomputing (PSB-06).

Reinert, K. and Kohlbacher, O. and Gröpl, C. and Lange, E. and Schulz-Trieglaff, O. and Sturm, M. and Pfeifer, N. (2006) OpenMS - A Framework for Quantitative HPLC/MS-Based Proteomics. In: Computational Proteomics.

Kohlbacher, O. and Reinert, K. and Gröpl, C. and Lange, E. and Pfeiffer, N. and Schulz-Trieglaff, O. and Sturm, M. (2006) TOPP - The OpenMS Proteomics Pipeline. In: Proceedings of the 5th European Conference on Computational Biology (ECCB 2006).

2005

Gröpl, C. (2005) An Algorithm for Feature Finding in LC/MS Raw Data. In: Computational Proteomics.

Gröpl, C. and Lange, E. and Reinert, K. and Sturm, M. and Huber, Ch. and Mayr, B. M. and Klein, C. L. (2005) Algorithms for the automated absolute quantification of diagnostic markers in complex proteomics samples. In: Proceedings of the 1st International Symposium on Computational Life Science (CompLife05).

Lange, E. and Gröpl, C. and Reinert, K. and Hildebrandt, A. (2005) High-accuracy peak picking of proteomics data. In: Computational Proteomics.

Reinert, K. and Kohlbacher, O. and Gröpl, C. and Lange, E. and Schulz-Trieglaff, O. and Sturm, M. and Pfeifer, N. (2005) OpenMS - A Framework for Quantitative HPLC/MS-Based Proteomics. In: Computational Proteomics.

Gröpl, C. and Hildebrandt, A. and Lange, E. and Lövenich, S. and Sturm, M. (2005) OpenMS - Software for Mass Spectrometry. UNSPECIFIED.

Gröpl, C. and Hildebrandt, A. and Lange, E. and Sturm, M. (2005) OpenMS - a generic open source framework for HPLC/MS-based proteomics. UNSPECIFIED.

Bodirsky, M. and Gröpl, C. and Kang, M. (2005) Sampling Unlabeled Biconnected Planar Graphs. In: Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC05).

Bodirsky, M. and Gröpl, C. and Johannsen, D. and Kang, M. (2005) A direct decomposition of 3-connected planar graphs. In: Proceedings of the 17th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC05).

2004

Gröpl, C. and Prömel, H.-J. and Srivastav, A. (2004) Ordered binary decision diagrams and the Shannon effect. Discrete Applied Mathematics, 142 . pp. 67-85.

2003

Frömmel, C. and Gille, Ch. and Goede, A. and Gröpl, C. and Hougardy, S. and Nierhoff, T. and Preissner, R. and Thimm, M. (2003) Accelerating screening of 3D protein data with a graph theoretical approach. Bioinformatics, 19 (18). pp. 2442-2447.

Gröpl, C. (2003) Algorithmen in der Bioinformatik. UNSPECIFIED.

Bodirsky, M. and Gröpl, C. and Kang, M. (2003) Decomposing, Counting, and Generating Unlabeled Cubic Planar Graphs. In: European Conference on Combinatorics, Graph Theory, and Applications EUROCOMB'03 Prague.

Bodirsky, M. and Gröpl, C. and Kang, M. (2003) Generating labeled planar graphs uniformly at random. In: Proceedings of ICALP 2003.

2002

Gröpl, C. and Hougardy, S. and Nierhoff, T. and Prömel, H.-J. and Thimm, M. (2002) Approximationsalgorithmen für das Steinerbaumproblem in Graphen. UNSPECIFIED.

Gröpl, C. and Hougardy, S. and Nierhoff, T. and Prömel, H.-J. (2002) Steiner trees in uniformly quasi-bipartite graphs. Information Processing Letters, 83 . pp. 195-200.

2001

Gröpl, C. and Hougardy, S. and Nierhoff, T. and Prömel, H.-J. (2001) Approximation Algorithms for the Steiner Tree Problem in Graphs. In: Steiner Trees in Industry. Kluwer Academic Publishers, pp. 235-279.

Gröpl, C. and Hougardy, S. and Nierhoff, T. and Prömel, H.-J. (2001) Lower bounds for approximation algorithms for the Steiner tree problem. In: Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (2001).

Gröpl, C. and Prömel, H.-J. and Srivastav, A. (2001) On the Evolution of the Worst-Case OBDD Size. Information Processing Letters, 77 . pp. 1-7.

2000

Baudis, G. and Gröpl, C. and Hougardy, S. and Nierhoff, T. and Prömel, H.-J. (2000) Approximating Minimum Spanning Sets in Hypergraphs and Polymatroids. Technical Report. UNSPECIFIED.

1999

Gröpl, C. (1999) Binary Decision Diagrams for Random Boolean Functions. PhD thesis, Humboldt-Universität zu Berlin.

1998

Gröpl, C. and Skutella, M. (1998) Parallel Repetition of MIP(2,1) Systems. In: Lectures on Proof Verification and Approximation Algorithms. Lecture Notes in Computer Science, 1367 . Springer, pp. 161-177.

Gröpl, C. and Prömel, H.-J. and Srivastav, A. (1998) Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). In: STACS 98.

1997

Block, M. and Gröpl, C. and Preuss, H. and Prömel, H. J. and Srivastav, A. (1997) Efficient ordering of state variables and transition relation partitions in symbolic model checking. Technical Report. UNSPECIFIED.

1996

Gröpl, C. (1996) Über Approximationsalgorithmen zur Färbung k-färbbarer Graphen, die vektorchromatische Zahl und andere Varianten der vartheta-Funktion. Masters thesis, Rheinische Friedrich-Wilhelms-Universität Bonn.