Your search returned the following 33 documents:

33. Aligning multiple sequences by cutting planes
    Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, and Knut Reinert
    Mathematical Programming 2006: 387-425, 2006
    
32. A combinatorial approach to protein docking with flexible side chains
    Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, and Peter Müller
    Journal of Computational Biology 9 (4): 597-612, 2002
    
31. Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics
    Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, and Knut Reinert
    In: Proceedings of the European Conference on Computational Biology (ECCB 2002), Saarbrücken, 2002, S4-S16
    
30. A Combinatorial Approach to Protein Docking with Flexible Side-Chains
    Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, and Peter Müller
    In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), Tokyo, Japan, April 8-11, 2000, 2000, 15-24
    
29. A polyhedral approach to sequence alignment problems
    John Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, and Martin Vingron
    Discrete Applied Mathematics 104 (1/3): 143-186, 2000
    
    
28. BALL - Rapid Software Prototyping in Computational Molecular Biology
    Oliver Kohlbacher and Hans-Peter Lenhof
    Bioinformatics 16 (9): 815-824, 2000
    
27. Modeling the Sugar Lectin Interaction by Computational Chemistry Relevant to Drug Design
    Dirk Neumann, Oliver Kohlbacher, Eleonore Haltner, Hans-Peter Lenhof, and Claus-Michael Lehr
    In: Proceedings of the 3rd World Meeting on Pharmaceutics, Biopharmaceutics and Pharmaceutical Technology, Berlin, Germany, April, 3-6, 2000, 233 p.
    
26. Simulating synthetic polymer chains in parallel
    Bernd Jung, Hans-Peter Lenhof, Peter Müller, and Christine Rüb
    Future Generation Computer Systems 16 (5): 513-522, 2000
    
25. An exact solution for the segment-to-segment multiple sequence alignment problem
    Hans-Peter Lenhof, Burkhard Morgenstern, and Knut Reinert
    Bioinformatics 15 (3): 203-210, 1999
    
24. BALL: Biochemical Algorithms Library
    Nicolas Pascal Boghossian, Oliver Kohlbacher, and Hans-Peter Lenhof
    In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, London, UK, July 19-21, 1999, 330-344
    
23. Bioinformatik
    Hans-Peter Lenhof
    Habilitation thesis, Universität des Saarlandes, 1999
    
22. q-gram Based Database Searching Using a Suffix Array (QUASAR)
    Stefan Burkhardt, Andreas Crauser, Paolo Ferragina, Hans-Peter Lenhof, Eric Rivals, and Martin Vingron
    In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), Lyon, France, April 11-14, 1999, 77-83
    
21. Rapid Software Prototyping in Computational Molecular Biology
    Oliver Kohlbacher and Hans-Peter Lenhof
    In: Proceedings of the German Conference on Bioinformatics (GCB'99), Hannover, Germany, October, 4 - 6, 1999, 81-92
    
20. Simulating synthetic polymer chains in parallel
    Bernd Jung, Hans-Peter Lenhof, Peter Müller, and Christine Rüb
    In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), Amsterdam, Netherlands, April 12-14, 1999, 1999, 13-22
    
19. A polyhedral approach to RNA sequence structure alignment
    Hans-Peter Lenhof, Knut Reinert, and Martin Vingron
    In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), New York, USA, March 22-25, 1998, 153-162
    
18. A Polyhedral Approach to RNA Sequence Structure Alignment
    Hans-Peter Lenhof, Knut Reinert, and Martin Vingron
    Journal of Computational Biology 5 (3): 517-530, 1998
    
17. Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier
    Dirk Neumann, Elleonore Haltner, Claus-Michael Lehr, Oliver Kohlbacher, and Hans-Peter Lenhof
    In: Proceedings of the 18th Interlec Meeting, Portsmuth, UK, July, 28 - July, 31, 1998, 549 p.
    
16. A Branch-And-Cut algorithm for multiple sequence alignment
    Knut Reinert, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, and John Kececioglu
    In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), Santa Fe, USA, January 20-23, 1997, 241-250
    
    
15. Computational Molecular Biology
    Martin Vingron, Hans-Peter Lenhof, and Petra Mutzel
    In: Annotated Bibliographies in Combinatorial Optimization, 1997, 445-471
    
14. Langevin dynamics simulations of macromolecules on parallel computers
    Bernd Jung, Hans-Peter Lenhof, Peter Müller, and Christine Rüb
    Macromolecular Theory and Simulation 6: 507-521, 1997
    
13. New contact measures for the protein docking problem
    Hans-Peter Lenhof
    In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), Santa Fe, USA, January 20 - 23, 1997, 182-191
    
12. Parallel MD-simulations of synthetic polymers
    Bernd Jung, Hans-Peter Lenhof, Peter Müller, and Christine Rüb
    In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, Minneapolis, USA, March, 1997
    
11. Parallel Protein Puzzle: A New Suite of Protein Docking Tools
    Hans-Peter Lenhof
    In: Forschung und wissenschaftliches Rechnen: Beiträge zum Heinz-Billing-Preis 1996, 1997, 31-48
    
10. An Algorithm for the Protein Docking Problem
    Hans-Peter Lenhof
    In: Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, 1995, 125-139
    
9. Maintaining the visibility map of spheres while moving the viewpoint
   Hans-Peter Lenhof and Michiel Smid
   Algorithmica 13 (3): 301-312, 1995
   
8. Sequential and parallel algorithms for the k closest pairs problem
   Hans-Peter Lenhof and Michiel Smid
   International Journal of Computational Geometry & Applications 5 (3): 273-288, 1995
   
7. Static and dynamic algorithms for k-point clustering problems
   Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, and Michiel Smid
   Journal of Algorithms 19 (3): 474-503, 1995
   
6. An animation of a fixed-radius all-nearest neighbors algorithm
   Hans-Peter Lenhof and Michiel Smid
   In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), Stony Brook, New York, USA, June, 6th - 8th, 1994, 387 p.
   
5. Using persistent data structures for adding range restrictions to searching problems
   Hans-Peter Lenhof and Michiel Smid
   RAIRO Theoretical Informatics and Applications 28: 25-49, 1994
   
4. An optimal construction method for generalized convex layers
   Hans-Peter Lenhof and Michiel Smid
   International Journal of Computational Geometry & Applications 3 (3): 245-267, 1993
   
3. An optimal construction method for generalized convex layers
   Hans-Peter Lenhof and Michiel Smid
   In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, Taipei, Republic of China, December, 16th - 18th, 1991, 349-363
   
2. Enumerating the k closest pairs optimally
   Hans-Peter Lenhof and Michiel Smid
   In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), Pittsburgh, Pennsylvania, USA, October, 24th - 27th, 1992, 380-386
   
1. Maintaining the visibility map of speres while moving the viewpoint on a circle at infinity
   Hans-Peter Lenhof and Michiel Smid
   In: Algorithms Theory - SWAT'92: Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July, 8th - 10th, 1992, 388-398