The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Hans-Peter Lenhof: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hans-Peter Lenhof, Michiel H. M. Smid
    An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:387- [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    Computational Proteomics, 2005, pp:- [Conf]
  3. Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert
    Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. [Citation Graph (0, 0)][DBLP]
    ECCB, 2002, pp:4-16 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    ECCB, 2002, pp:219-230 [Conf]
  5. Hans-Peter Lenhof, Michiel H. M. Smid
    Enumerating the k Closest Pairs Optimally [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:380-386 [Conf]
  6. Oliver Kohlbacher, Hans-Peter Lenhof
    Rapid Software Prototyping in Computational Molecular Biology. [Citation Graph (0, 0)][DBLP]
    German Conference on Bioinformatics, 1999, pp:81-92 [Conf]
  7. Knut Reinert, Hans-Peter Lenhof, Burkhard Morgenstern
    An exact solution for the Segment-to-Segment multiple sequence alignment problem. [Citation Graph (0, 0)][DBLP]
    German Conference on Bioinformatics, 1998, pp:- [Conf]
  8. Bernd Jung, Hans-Peter Lenhof, Peter Müller, Christine Rüb
    Simulating Synthetic Polymer Chains in Parallel. [Citation Graph (0, 0)][DBLP]
    HPCN Europe, 1999, pp:13-22 [Conf]
  9. Hans-Peter Lenhof, Michiel H. M. Smid
    An Optimal Construction Method for Generalized Convex Layers. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:349-363 [Conf]
  10. Bernd Jung, Hans-Peter Lenhof, Peter Müller, Christine Rüb
    Parallel MD-Simulations of Synthetic Polymers. [Citation Graph (0, 0)][DBLP]
    PPSC, 1997, pp:- [Conf]
  11. Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, Peter Müller
    A combinatorial approach to protein docking with flexible side-chains. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2000, pp:15-24 [Conf]
  12. Stefan Burkhardt, Andreas Crauser, Paolo Ferragina, Hans-Peter Lenhof, Eric Rivals, Martin Vingron
    q-gram based database searching using a suffix array (QUASAR). [Citation Graph (0, 0)][DBLP]
    RECOMB, 1999, pp:77-83 [Conf]
  13. Oliver Kohlbacher, Andreas Burchardt, Andreas Moll, Andreas Hildebrandt, Peter Bayer, Hans-Peter Lenhof
    A NMR-spectra-based scoring function for protein docking. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2001, pp:184-192 [Conf]
  14. Hans-Peter Lenhof
    New contact measures for the protein docking problem. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:182-191 [Conf]
  15. Hans-Peter Lenhof, Knut Reinert, Martin Vingron
    A polyhedral approach to RNA sequence structure alignment. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1998, pp:153-162 [Conf]
  16. Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu
    A branch-and-cut algorithm for multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:241-250 [Conf]
  17. Hans-Peter Lenhof, Michiel H. M. Smid
    Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:388-398 [Conf]
  18. Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid
    Static and Dynamic Algorithms for k-Point Clustering Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:265-276 [Conf]
  19. Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lenhof
    BALL: Biochemical Algorithms Library. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:331-345 [Conf]
  20. Hans-Peter Lenhof, Michiel H. M. Smid
    Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:3, pp:301-312 [Journal]
  21. Oliver Kohlbacher, Hans-Peter Lenhof
    BALL-rapid software prototyping in computational molecular biology. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2000, v:16, n:9, pp:815-824 [Journal]
  22. Hans-Peter Lenhof, Burkhard Morgenstern, Knut Reinert
    An exact solution for the segment-to-segment multiple sequence alignment problem. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 1999, v:15, n:3, pp:203-210 [Journal]
  23. Andreas Moll, Andreas Hildebrandt, Hans-Peter Lenhof, Oliver Kohlbacher
    BALLView: a tool for research and education in molecular modeling. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:3, pp:365-366 [Journal]
  24. Andreas Hildebrandt, Ralf Blossey, Sergej Rjasanow, Oliver Kohlbacher, Hans-Peter Lenhof
    Electrostatic potentials of proteins in water: a structured continuum approach. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2007, v:23, n:2, pp:99-103 [Journal]
  25. John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, Martin Vingron
    A polyhedral approach to sequence alignment problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:104, n:1-3, pp:143-186 [Journal]
  26. Hans-Peter Lenhof, Michiel H. M. Smid
    Sequential and parallel algorithms for the k closest pairs problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:273-288 [Journal]
  27. Hans-Peter Lenhof, Michiel H. M. Smid
    An optimal construction method for generalized convex layers. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:245-267 [Journal]
  28. Ralf Hofestädt, Hans-Peter Lenhof
    Molekulare Bioinformatik. [Citation Graph (0, 0)][DBLP]
    it - Information Technology, 2004, v:46, n:1, pp:3-4 [Journal]
  29. Hans-Peter Lenhof, Michiel H. M. Smid
    Using Persistent Data Structures for Adding Range Restrictions to Searching Problems. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:1, pp:25-49 [Journal]
  30. Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid
    Static and Dynamic Algorithms for k-Point Clustering Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:3, pp:474-503 [Journal]
  31. Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, Peter Müller
    A Combinatorial Approach to Protein Docking with Flexible Side Chains. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2002, v:9, n:4, pp:597-612 [Journal]
  32. Hans-Peter Lenhof, Knut Reinert, Martin Vingron
    A Polyhedral Approach to RNA Sequence Structure Alignment. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1998, v:5, n:3, pp:517-530 [Journal]
  33. Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lenhof
    Rapid Software Prototyping in Molecular Modeling Using the Biochemical Algorithms Library (BALL). [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:16- [Journal]
  34. Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert
    A branch-and-cut algorithm for multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:387-425 [Journal]
  35. Christina Backes, Jan Kuentzer, 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. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2005, v:33, n:Web-Server-Issue, pp:208-213 [Journal]
  36. Bernd Jung, Hans-Peter Lenhof, Peter Müller, Christine Rüb
    Simulating synthetic polymer chains in parallel. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 2000, v:16, n:5, pp:513-522 [Journal]

  37. Integer Linear Programming in Computational Biology. [Citation Graph (, )][DBLP]


  38. Automated Bond Order Assignment as an Optimization Problem. [Citation Graph (, )][DBLP]


  39. Real-Time Ray Tracing of Complex Molecular Scenes. [Citation Graph (, )][DBLP]


  40. A novel algorithm for detecting differentially regulated paths based on gene set enrichment analysis. [Citation Graph (, )][DBLP]


  41. BNDB - The Biochemical Network Database. [Citation Graph (, )][DBLP]


  42. Computation of significance scores of unweighted Gene Set Enrichment Analyses. [Citation Graph (, )][DBLP]


  43. GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments. [Citation Graph (, )][DBLP]


  44. A minimally invasive multiple marker approach allows highly efficient detection of meningioma tumors. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.306secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002