| 2013 | ||
|---|---|---|
| j34 | Anna Katharina Dehof, Simon Loew, Hans-Peter Lenhof, Andreas Hildebrandt: NightShift: NMR Shift Inference by General Hybrid Model Training - a Framework for NMR Chemical Shift Prediction. BMC Bioinformatics 14: 98 (2013) | |
| 2012 | ||
| j33 | Cedric Laczny, Petra Leidinger, Jan Haas, Nicole Ludwig, Christina Backes, Andreas Gerasch, Michael Kaufmann, Britta Vogel, Hugo A. Katus, Benjamin Meder, Cord Stähler, Eckart Meese, Hans-Peter Lenhof, Andreas Keller: miRTrail - a comprehensive webserver for analyzing gene and miRNA patterns to enhance the understanding of regulatory mechanisms in diseases. BMC Bioinformatics 13: 36 (2012) | |
| c24 | Stefan Nickels, Hienke Sminia, Sabine C. Mueller, Bas Kools, Anna Katharina Dehof, Hans-Peter Lenhof, Andreas Hildebrandt: ProteinScanAR - An Augmented Reality Web Application for High School Education in Biomolecular Life Sciences. IV 2012: 578-583 | |
| 2011 | ||
| j32 | Anna Katharina Dehof, Alexander Rurainski, Quang Bao Anh Bui, Sebastian Böcker, Hans-Peter Lenhof, Andreas Hildebrandt: Automated bond order assignment as an optimization problem. Bioinformatics 27(5): 619-625 (2011) | |
| 2010 | ||
| j31 | Andreas Hildebrandt, Anna Katharina Dehof, Alexander Rurainski, Andreas Bertsch, Marcel Schumann, Nora C. Toussaint, Andreas Moll, Daniel Stöckel, Stefan Nickels, Sabine C. Mueller, Hans-Peter Lenhof, Oliver Kohlbacher: BALL - biochemical algorithms library 1.3. BMC Bioinformatics 11: 531 (2010) | |
| j30 | Kay Nieselt, Michael Kaufmann, Andreas Gerasch, Hans-Peter Lenhof, Marcel Spehr, Stefan Hesse, Stefan Gumhold: Visuelle Analytik biologischer Daten. Informatik Spektrum 33(6): 559-568 (2010) | |
| j29 | Jan Fuhrmann, Alexander Rurainski, Hans-Peter Lenhof, Dirk Neumann: A new Lamarckian genetic algorithm for flexible ligand-receptor docking. Journal of Computational Chemistry 31(9): 1911-1918 (2010) | |
| c23 | Mike Phillips, Iliyan Georgiev, Anna Katharina Dehof, Stefan Nickels, Lukas Marsalek, Hans-Peter Lenhof, Andreas Hildebrandt, Philipp Slusallek: Measuring properties of molecular surfaces using ray casting. IPDPS Workshops 2010: 1-7 | |
| c22 | Lukas Marsalek, Anna Katharina Dehof, Iliyan Georgiev, Hans-Peter Lenhof, Philipp Slusallek, Andreas Hildebrandt: Real-Time Ray Tracing of Complex Molecular Scenes. IV 2010: 239-245 | |
| 2009 | ||
| j28 | Andreas Keller, Christina Backes, Andreas Gerasch, Michael Kaufmann, Oliver Kohlbacher, Eckart Meese, Hans-Peter Lenhof: A novel algorithm for detecting differentially regulated paths based on gene set enrichment analysis. Bioinformatics 25(21): 2787-2794 (2009) | |
| j27 | Andreas Keller, Nicole Ludwig, Sabrina Heisel, Petra Leidinger, Claudia Andres, Wolf-Ingo Steudel, Hanno Huwer, Bernhard Burgeth, Matthias Hein, Joachim Weickert, Eckart Meese, Hans-Peter Lenhof: Large-scale antibody profiling of human blood sera: The future of molecular diagnosis. Informatik Spektrum 32(4): 332-338 (2009) | |
| j26 | 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) | |
| j25 | 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) | |
| c21 | Ernst Althaus, Gunnar W. Klau, Oliver Kohlbacher, Hans-Peter Lenhof, Knut Reinert: Integer Linear Programming in Computational Biology. Efficient Algorithms 2009: 199-218 | |
| c20 | Anna Katharina Dehof, Alexander Rurainski, Hans-Peter Lenhof, Andreas Hildebrandt: Automated Bond Order Assignment as an Optimization Problem. GCB 2009: 201-209 | |
| 2008 | ||
| j24 | Andreas Keller, Christina Backes, Maher Al-Awadhi, Andreas Gerasch, Jan Küntzer, Oliver Kohlbacher, Michael Kaufmann, Hans-Peter Lenhof: GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments. BMC Bioinformatics 9 (2008) | |
| 2007 | ||
| j23 | 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) | |
| j22 | Andreas Keller, Christina Backes, Hans-Peter Lenhof: Computation of significance scores of unweighted Gene Set Enrichment Analyses. BMC Bioinformatics 8 (2007) | |
| j21 | Jan Küntzer, Christina Backes, Torsten Blum, Andreas Gerasch, Michael Kaufmann, Oliver Kohlbacher, Hans-Peter Lenhof: BNDB - The Biochemical Network Database. BMC Bioinformatics 8 (2007) | |
| j20 | 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) | |
| j19 | 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 | ||
| j18 | 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) | |
| j17 | Andreas Keller, Nicole Ludwig, Nicole Comtesse, Andreas Hildebrandt, Eckart Meese, Hans-Peter Lenhof: A minimally invasive multiple marker approach allows highly efficient detection of meningioma tumors. BMC Bioinformatics 7: 539 (2006) | |
| j16 | 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) | |
| j15 | 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 | ||
| j14 | 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) | |
| c19 | 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 | |
| 2004 | ||
| j13 | Ralf Hofestädt, Hans-Peter Lenhof: Molekulare Bioinformatik. it - Information Technology 46(1): 3-4 (2004) | |
| 2002 | ||
| j12 | 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) | |
| c18 | 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 | |
| c17 | 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 | |
| 2001 | ||
| c16 | 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 | ||
| j11 | Oliver Kohlbacher, Hans-Peter Lenhof: BALL-rapid software prototyping in computational molecular biology. Bioinformatics 16(9): 815-824 (2000) | |
| j10 | 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) | |
| j9 | 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) | |
| j8 | 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) | |
| c15 | Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, Peter Müller: A combinatorial approach to protein docking with flexible side-chains. RECOMB 2000: 15-24 | |
| 1999 | ||
| j7 | 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) | |
| c14 | Oliver Kohlbacher, Hans-Peter Lenhof: Rapid Software Prototyping in Computational Molecular Biology. German Conference on Bioinformatics 1999: 81-92 | |
| c13 | Bernd Jung, Hans-Peter Lenhof, Peter Müller, Christine Rüb: Simulating Synthetic Polymer Chains in Parallel. HPCN Europe 1999: 13-22 | |
| c12 | 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 | |
| c11 | Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lenhof: BALL: Biochemical Algorithms Library. Algorithm Engineering 1999: 331-345 | |
| 1998 | ||
| j6 | Hans-Peter Lenhof, Knut Reinert, Martin Vingron: A Polyhedral Approach to RNA Sequence Structure Alignment. Journal of Computational Biology 5(3): 517-530 (1998) | |
| c10 | Knut Reinert, Hans-Peter Lenhof, Burkhard Morgenstern: An exact solution for the Segment-to-Segment multiple sequence alignment problem. German Conference on Bioinformatics 1998 | |
| c9 | Hans-Peter Lenhof, Knut Reinert, Martin Vingron: A polyhedral approach to RNA sequence structure alignment. RECOMB 1998: 153-162 | |
| 1997 | ||
| c8 | Bernd Jung, Hans-Peter Lenhof, Peter Müller, Christine Rüb: Parallel MD-Simulations of Synthetic Polymers. PPSC 1997 | |
| c7 | ||
| c6 | 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 | ||
| j5 | 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) | |
| j4 | 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) | |
| j3 | 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 | ||
| j2 | Hans-Peter Lenhof, Michiel H. M. Smid: Using Persistent Data Structures for Adding Range Restrictions to Searching Problems. ITA 28(1): 25-49 (1994) | |
| c5 | Hans-Peter Lenhof, Michiel H. M. Smid: An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm. Symposium on Computational Geometry 1994: 387 | |
| 1993 | ||
| j1 | 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) | |
| c4 | Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid: Static and Dynamic Algorithms for k-Point Clustering Problems. WADS 1993: 265-276 | |
| 1992 | ||
| c3 | Hans-Peter Lenhof, Michiel H. M. Smid: Enumerating the k Closest Pairs Optimally. FOCS 1992: 380-386 | |
| c2 | 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 | ||
| c1 | Hans-Peter Lenhof, Michiel H. M. Smid: An Optimal Construction Method for Generalized Convex Layers. ISA 1991: 349-363 | |
Data released under the ODC-BY 1.0 license — See also our legal information page