2009 | ||
---|---|---|
41 | EE | Jan Fuhrmann, Alexander Rurainski, Hans-Peter Lenhof, Dirk Neumann: A new method for the gradient-based optimization of molecular complexes. Journal of Computational Chemistry 30(9): 1371-1378 (2009) |
40 | EE | Alexander Rurainski, Andreas Hildebrandt, Hans-Peter Lenhof: A consensus line search algorithm for molecular potential energy functions. Journal of Computational Chemistry 30(9): 1499-1509 (2009) |
2007 | ||
39 | EE | Andreas Hildebrandt, Ralf Blossey, Sergej Rjasanow, Oliver Kohlbacher, Hans-Peter Lenhof: Electrostatic potentials of proteins in water: a structured continuum approach. Bioinformatics 23(2): 99-103 (2007) |
38 | EE | Christina Backes, Andreas Keller, Jan Küntzer, Benny Kneissl, Nicole Comtesse, Yasser A. Elnakady, Rolf Müller, Eckart Meese, Hans-Peter Lenhof: GeneTrail - advanced gene set enrichment analysis. Nucleic Acids Research 35(Web-Server-Issue): 186-192 (2007) |
37 | EE | Andreas Keller, Nicole Comtesse, Nicole Ludwig, Eckart Meese, Hans-Peter Lenhof: SePaCS - a web-based application for classification of seroreactivity profiles. Nucleic Acids Research 35(Web-Server-Issue): 683-687 (2007) |
2006 | ||
36 | EE | Andreas Moll, Andreas Hildebrandt, Hans-Peter Lenhof, Oliver Kohlbacher: BALLView: a tool for research and education in molecular modeling. Bioinformatics 22(3): 365-366 (2006) |
35 | EE | Jan Küntzer, Torsten Blum, Andreas Gerasch, Christina Backes, Andreas Hildebrandt, Michael Kaufmann, Oliver Kohlbacher, Hans-Peter Lenhof: BN++ - A Biological Information System. J. Integrative Bioinformatics 3(2): (2006) |
34 | EE | Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert: A branch-and-cut algorithm for multiple sequence alignment. Math. Program. 105(2-3): 387-425 (2006) |
2005 | ||
33 | EE | Hansjörg Toll, Peter Berger, Andreas Hofmann, Andreas Hildebrandt, Herbert Oberacher, Hans-Peter Lenhof, Christian G. Huber: Glycosylation Patterns of Proteins Studied by Liquid Chromatography-Mass Spectrometry and Bioinformatic Tools. Computational Proteomics 2005 |
32 | EE | Christina Backes, Jan Küntzer, Hans-Peter Lenhof, Nicole Comtesse, Eckart Meese: GraBCas: a bioinformatics tool for score-based prediction of Caspase- and Granzyme B-cleavage sites in protein sequences. Nucleic Acids Research 33(Web-Server-Issue): 208-213 (2005) |
2004 | ||
31 | EE | Ralf Hofestädt, Hans-Peter Lenhof: Molekulare Bioinformatik. it - Information Technology 46(1): 3-4 (2004) |
2002 | ||
30 | Marite Sirava, T. Schäfer, Markus Eiglsperger, Michael Kaufmann, Oliver Kohlbacher, Erich Bornberg-Bauer, Hans-Peter Lenhof: BioMiner - modeling, analyzing, and visualizing biochemical pathways and networks. ECCB 2002: 219-230 | |
29 | Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert: Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. ECCB 2002: 4-16 | |
28 | Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, Peter Müller: A Combinatorial Approach to Protein Docking with Flexible Side Chains. Journal of Computational Biology 9(4): 597-612 (2002) | |
2001 | ||
27 | EE | Oliver Kohlbacher, Andreas Burchardt, Andreas Moll, Andreas Hildebrandt, Peter Bayer, Hans-Peter Lenhof: A NMR-spectra-based scoring function for protein docking. RECOMB 2001: 184-192 |
2000 | ||
26 | EE | Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, Peter Müller: A combinatorial approach to protein docking with flexible side-chains. RECOMB 2000: 15-24 |
25 | EE | Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lenhof: Rapid Software Prototyping in Molecular Modeling Using the Biochemical Algorithms Library (BALL). ACM Journal of Experimental Algorithmics 5: 16 (2000) |
24 | Oliver Kohlbacher, Hans-Peter Lenhof: BALL-rapid software prototyping in computational molecular biology. Bioinformatics 16(9): 815-824 (2000) | |
23 | John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, Martin Vingron: A polyhedral approach to sequence alignment problems. Discrete Applied Mathematics 104(1-3): 143-186 (2000) | |
22 | EE | Bernd Jung, Hans-Peter Lenhof, Peter Müller, Christine Rüb: Simulating synthetic polymer chains in parallel. Future Generation Comp. Syst. 16(5): 513-522 (2000) |
1999 | ||
21 | EE | Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lenhof: BALL: Biochemical Algorithms Library. Algorithm Engineering 1999: 331-345 |
20 | Oliver Kohlbacher, Hans-Peter Lenhof: Rapid Software Prototyping in Computational Molecular Biology. German Conference on Bioinformatics 1999: 81-92 | |
19 | Bernd Jung, Hans-Peter Lenhof, Peter Müller, Christine Rüb: Simulating Synthetic Polymer Chains in Parallel. HPCN Europe 1999: 13-22 | |
18 | EE | Stefan Burkhardt, Andreas Crauser, Paolo Ferragina, Hans-Peter Lenhof, Eric Rivals, Martin Vingron: q-gram based database searching using a suffix array (QUASAR). RECOMB 1999: 77-83 |
17 | Hans-Peter Lenhof, Burkhard Morgenstern, Knut Reinert: An exact solution for the segment-to-segment multiple sequence alignment problem. Bioinformatics 15(3): 203-210 (1999) | |
1998 | ||
16 | Knut Reinert, Hans-Peter Lenhof, Burkhard Morgenstern: An exact solution for the Segment-to-Segment multiple sequence alignment problem. German Conference on Bioinformatics 1998 | |
15 | EE | Hans-Peter Lenhof, Knut Reinert, Martin Vingron: A polyhedral approach to RNA sequence structure alignment. RECOMB 1998: 153-162 |
14 | Hans-Peter Lenhof, Knut Reinert, Martin Vingron: A Polyhedral Approach to RNA Sequence Structure Alignment. Journal of Computational Biology 5(3): 517-530 (1998) | |
1997 | ||
13 | Bernd Jung, Hans-Peter Lenhof, Peter Müller, Christine Rüb: Parallel MD-Simulations of Synthetic Polymers. PPSC 1997 | |
12 | EE | Hans-Peter Lenhof: New contact measures for the protein docking problem. RECOMB 1997: 182-191 |
11 | EE | Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu: A branch-and-cut algorithm for multiple sequence alignment. RECOMB 1997: 241-250 |
1995 | ||
10 | Hans-Peter Lenhof, Michiel H. M. Smid: Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity. Algorithmica 13(3): 301-312 (1995) | |
9 | Hans-Peter Lenhof, Michiel H. M. Smid: Sequential and parallel algorithms for the k closest pairs problem. Int. J. Comput. Geometry Appl. 5(3): 273-288 (1995) | |
8 | Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid: Static and Dynamic Algorithms for k-Point Clustering Problems. J. Algorithms 19(3): 474-503 (1995) | |
1994 | ||
7 | EE | Hans-Peter Lenhof, Michiel H. M. Smid: An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm. Symposium on Computational Geometry 1994: 387 |
6 | Hans-Peter Lenhof, Michiel H. M. Smid: Using Persistent Data Structures for Adding Range Restrictions to Searching Problems. ITA 28(1): 25-49 (1994) | |
1993 | ||
5 | Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid: Static and Dynamic Algorithms for k-Point Clustering Problems. WADS 1993: 265-276 | |
4 | Hans-Peter Lenhof, Michiel H. M. Smid: An optimal construction method for generalized convex layers. Int. J. Comput. Geometry Appl. 3(3): 245-267 (1993) | |
1992 | ||
3 | Hans-Peter Lenhof, Michiel H. M. Smid: Enumerating the k Closest Pairs Optimally FOCS 1992: 380-386 | |
2 | Hans-Peter Lenhof, Michiel H. M. Smid: Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity. SWAT 1992: 388-398 | |
1991 | ||
1 | Hans-Peter Lenhof, Michiel H. M. Smid: An Optimal Construction Method for Generalized Convex Layers. ISA 1991: 349-363 |