Publications before 2008
January 18, 2012 2023-11-10 11:17Publications before 2008
2007
[KBB+07] Küntzer, J., Backes, C., Blum, T., Gerasch, A., Kaufmann, M., Kohlbacher, O., & Lenhof, H.-P. (2007). BNDB – The Biochemical Network Database. BMC Bioinformatics, 8, 367.
[KBL07] Keller, A., Backes, C., & Lenhof, H.-P. (2007). Computation of significance scores of unweighted Gene Set Enrichment Analyses. BMC Bioinformatics, 8, 290.
[ERS+07] Elnakady, Y. A., Rohde, M., Sasse, F., Backes, C., Keller, A., Lenhof, H.-P., Weissmann, K. J., & Müller, R. (2007). Evidence for the Mode of Action of the Highly Cytotoxic Streptomyces Polyketide Kendomycin. Chembiochem. 8(11), 1261-72.
[HBR+07] Hildebrandt, A., Blossey, R., Rjasanow, S., Kohlbacher, O., & Lenhof, H.-P. (2007). Electrostatic potentials of proteins in water: a structured continuum approach. Bioinformatics, Proceedings – European Conference on Computational Biology ECCB 2006 -, 23(2), e99-103.
[HKL07] Hildebrandt, A., Kohlbacher, O., & Lenhof, H.-P. (2007). Modeling protein-protein and protein-dna docking. In T. Lengauer (Eds.), Bioinformatics – From Genomes to Therapies (2, pp. 601-644).
[CKD+07] Comtesse, N., Keller, A., Diesinger, I., Bauer, C., Kayser, K., Huwer, H., Lenhof, H.-P., & Meese, E. (2007). Frequent overexpression of the genes fxr1, clapm1 and eif4g located on amplicon 3q26-27 in squamous cell carcinoma of the lung. Int. J. Cancer, 120(12), 2538-44.
[KCL+07] Keller, A., Comtesse, N., Ludwig, N., Meese, E., & Lenhof, H.-P. (2007). Sepacs–a web-based application for classification of seroreactivity profiles. Nucleic Acids Res., 35, W683-687.
[BKK+07] Backes, C., Keller, A., Küntzer, J., Kneissl, B., Comtesse, N., Elnakady, Y. A., Müller, R., Meese, E., & Lenhof, H.-P. (2007). Genetrail–advanced gene set enrichment analysis. Nucleic Acids Res., 35, W186-192.
2006
[BKN+06] Baldes, C., Koenig, P., Neumann, D., Lenhof, H.-P., Kohlbacher, O., & Lehr, C.-M. (2006). Development of a fluorescence-based assay for screening of modulators of human organic anion transporter 1b3 (oatp1b3). European Journal of Pharmaceutics and Biopharmaceutics, 62(1), 39-43.
[MHL+06] Moll, A., Hildebrandt, A., Lenhof, H.-P., & Kohlbacher, O. (2006). Ballview: a tool for research and education in molecular modeling. Bioinformatics, 22(3), 365-366.
[ACL+06] Althaus, E., Caprara, A., Lenhof, H.-P., & Reinert, K. (2006). A branch-and-cut algorithm for multiple sequence alignment. Mathematical Programming, 105(2-3), 387-425.
[KBG+06] Küntzer, J., Blum, T., Gerasch, A., Backes, C., Hildebrandt, A., Kaufmann, M., Kohlbacher, O., & Lenhof, H.-P. (2006). BN++ – A Biological Information System. Journal of Integrative Bioinformatics, 3(2), 34.
[TBH+06] Toll, H., Berger, P., Hofmann, A., Hildebrandt, A., Oberacher, H., Lenhof, H.-P., & Huber, C. G. (2006). Glycosylation patterns of human chorionic gonadotropin revealed by liquid chromatography-mass spectrometry and bioinformatics. Electrophoresis, 27(13), 2734-46.
[KLC+06] Keller, A., Ludwig, N., Comtesse, N., Hildebrandt, A., Meese, E., & Lenhof, H.-P. (2006). A minimally invasive multiple marker approach allows highly efficient detection of meningioma tumors. BMC Bioinformatics (7), 539.
2005
[MHL+05] Moll, A., Hildebrandt, A., Lenhof, H.-P. & Kohlbacher, O. (2005). BALLView: an object-oriented molecular visualization and modeling framework. J. Comput. Aided Mol. Des., 19(11), 791-800.
[BKL+05] Backes, C., Küntzer, J., Lenhof, H.-P., Comtesse, N., & Meese, E. (2005). Grabcas: a bioinformatics tool for score-based prediction of caspase- and granzyme b-cleavage sites in protein sequences. Nucleic Acids Res., 33, 208-213.
[CZW+05] Comtesse, N., Zippel, A., Walle, S., Monz, D., Backes, C., Fischer, U., Mayer, J., Ludwig, N., Hildebrandt, A., Keller, A., Steudel, W.-I., Lenhof, H.-P., & Meese, E. (2005). Complex humoral immune response against a benign tumor: frequent antibody response against specific antigens as diagnostic targets. PNAS, 102(27), 9601-06.
2004
[BRFD+05] K.H. Brämswig, A.B. Riemer, E. Förster-Waldl, A. Dehof, D. Neumann, H.N. Lode, C. Zielinski, O. Scheiner, H. Pehamberger, E. Jensen-Jarolim (2004): Generation of Peptide mimics of Melanoma Antigen GD2. Proceedings of the 35th Annual European Society for Dermatological Research (ESDR) Meeting, Journal of Investigative Dermatology 125(S1:A35)
[FRDN+05] E. Förster-Waldl, A.B. Riemer, A.K. Dehof, D. Neumann, K.H. Brämswig, G. Boltz-Nitulescu, H. Pehamberger, C. Zielinski, O. Scheiner, A. Plloak, H.N. Lode, and E. Jensen-Jarolim: (2004) Isolation and structural analysis of peptide mimotopes for the disialoganglioside GD2, a neuroblastoma tumor antigen Molecular Immunology.
[HBR+04] Hildebrandt, A., Blossey, R., Rjasanow, S., Kohlbacher, O., & Lenhof, H.-P. (2004). Novel formulation of nonlocal electrostatics. Phys. Rev. Lett., 93(10), 108104.
[DHS+04] Dönnes, P., Höglund, A., Sturm, M., Comtesse, N., Backes, C., Meese, E., Kohlbacher, O., & Lenhof, H.-P. (2004). Integrative analysis of cancer-related data using cap. FASEB J., 18(12), 1465-7.
[HL04] Ralf Hofestädt & H.-P. Lenhof (Eds.). (2004). Methoden und innovative anwendungen der informatik und informationstechnik. schwerpunktthema: molekulare bioinformatik. In H.-P. Hofestädt, & H.-P. Lenhof (Eds.), Information technology (it).
[NLL+04] Neumann, D., Lehr, C., Lenhof, H., & Kohlbacher, O. (2004). Computational modeling of the sugar-lectin interaction. Advanced DRUG DELIVERY Reviews, 56(4), 437-457.
2003
[LS03] H.-P. Lenhof & M.-F. Sagot (Eds.). (2003). Proceedings – European Conference on Computational Biology (ECCB) 2003 . In H.-P. Lenhof, & M.-F. Sagot (Eds.), Bioinformatics 19 (Suppl. 2), 1-256.
2002
[NKL+02] Neumann, D., Kohlbacher, O., Lenhof, H.-P., & Lehr, C.-M. (2002). Lectin-sugar interactions: calculated versus experimental binding energies. Eur. J. Biochem., 269, 1518-1524.
[SSE+02] Sirava, M., Schäfer, T., Eiglsperger, M., Kaufmann, M., Kohlbacher, O., Bornberg-Bauer, E., & Lenhof, H.-P. (2002). BioMiner – modeling, analysing, and visualizing biochemical pathways and networks. Bioinformatics, Proceedings of the European Conference on Computational Biology 2002, 18 (Suppl. 2), S219-S230.
[ACL+02] Althaus, E., Caprara, A., Lenhof, H.-P., & Reinert, K. (2002). Multiple sequence alignment with arbitrary gap costs: computing an optimal solution using polyhedral combinatorics. Bioinformatics, Proceedings of the European Conference on Computational Biology 2002, 18 (Suppl. 2), 4-16.
[LL02] Lengauer, T. & Lenhof, H.-P. (Eds.). (2002). European Conference on Computational Biology 2002. In T. Lengauer, & H.-P. Lenhof (Eds.), (pp. 1-260). Bioinformatics.
[AKL+02] Althaus, E., Kohlbacher, O., Lenhof, H.-P., & Müller, P. (2002). A combinatorial approach to protein docking with flexible side chains. Journal of Computational Biology, 9(4), 597-612.
2001
[KBM+01]
Kohlbacher, O., Burchardt, A., Moll, A., Hildebrandt, A., Bayer, P., & Lenhof, H.-P. (2001). A NMR-spectra-based scoring function for protein docking. In D. Sankoff, & T. Lengauer (Eds.), RECOMB 2001 – Proceedings of the Fifth Annual International Conference on Computational Molecular Biology (pp. 169-177). ACM press.
[KBM+01]
Kohlbacher, O., Burchardt, A., Moll, A., Hildebrandt, A., Bayer, P., & Lenhof, H.-P. (2001). Structure prediction of protein complexes by a NMR-based protein docking algorithm. J. Biomol. NMR, 20, 15-21.
2000
[KL00] Kohlbacher, O., & Lenhof, H.-P. (2000). BALL – Rapid Software Prototyping in Computational Molecular Biology. Bioinformatics, 16(9), 815-824.
[KLM+00] Kececioglu, J., Lenhof, H., Mehlhorn, K., Mutzel, M., & Vingron, M. (2000). A polyhedral approach to sequence alignment problems. Discrete Applied Mathematics, 104, 143-186.
[BKL00] Boghossian, N., Kohlbacher, O., & Lenhof, H.-P. (2000). Rapid software prototyping in molecular modeling using the biochemical algorithms library (ball). Journal of Experimental Algorithmics, 5(16).
[JLM+00] Jung, B., Lenhof, H.-P., Müller, P., & Rüb, C. (2000). Simulating synthetic polymer chains in parallel. Future Generation Computer Systems, Elsevier Special Issues, 16, 513-522.
1999
[BKL99] Boghossian, N. P., Kohlbacher, O., & Lenhof, H.-P. (1999). BALL: Biochemical Algorithms Library. In J. Vitter, & C. Zaroliagis (Eds.), Lecture Notes in Computer Science (LNCS): Vol. 1668. Algorithm Engineering, 3rd International Workshop, WAE’99, Proceedings (pp. 330-344). Springer.
[KL99] Kohlbacher, O., & Lenhof, H.-P. (1999). Rapid software prototyping in computational molecular biology. In XX (Ed.), Proceedings of the German Conference on Bioinformatics (GCB’99).
[LMR99] Lenhof, H.-P., Morgenstern, B., & Reinert, K. (1999). An exact solution for the segment-to-segment multiple sequence alignment problem. Bioinformatics, 15(3), 203-210.
1998
[LRV98] Lenhof, H.-P., Reinert, K., & Vingron, M. (1998). A polyhedral approach to rna sequence structure alignment. Journal of Computational Biology, 5(3), 517-530.
1997
[VLM97] Vingron, M., Lenhof, H.-P., & Mutzel, P. (1997). Computational molecular biology. In Annotated Bibliographies in Combinatorial Optimization, M.Dell’Amico, F. Maffioli, & S. Martello (Eds.) (pp. 445-471). John Wiley and Sons, ISBN: 047196574X.
[RLM+97] Reinert, K., Lenhof, H.-P., Mutzel, P., Mehlhorn, K., & Kececioglu, J.D. (1997). A branch-and-cut algorithm for multiple sequence alignment. RECOMB 1997 (241-250).
[Len97] Lenhof, H.-P. (1997). New contact measures for the protein docking problem. Proc. of the First Annual International Conference on Computational Molecular Biology RECOMB 1997 (pp. 182-191).
[JLM+97] Jung, B., Lenhof, H.-P., Müller, P., & Rüb, C. (1997). Langevin dynamics simulations of macromolecules on parallel computers. Macromol. Theory and Simul., 6, 507-521.
1995
[Len95] Lenhof, H.-P. (1995). An algorithm for the protein docking problem. German Conference on Bioinformatics, 18, 125-139.
[LS95] Lenhof, H.-P., & Smid, M. (1995). Maintaining a visibility map of spheres while moving the viewpoint on a circle at infinity. Algorithmica, 13, 301-312.
[DLS+95]
Datta, A., Lenhof, H.-P., Schwarz, C., & Smid, M. (1995). Static and dynamic algorithms for the k-point clustering problems. Journal of Algorithms, 19, 474-503.
[LS95]
Lenhof, H.-P., & Smid, M. (1995). Sequential and parallel algorithms for the k closest pairs problem. Int. J. Comput. Geometry Appl., 5(3), 273-288.
1994
[LS94] Lenhof, H.-P., & Smid, M. (1994). Using persistant data structures for adding range restrictions to searching problems. RAIRO Theoretical Informatics and Application, 28, 25-49.
1993
[LS93] Lenhof, H.-P., & Smid, M. (1993). An optimal construction method for generalized convex layers. International Journal of Computational Geometry & Applications, 3(3), 245-267.
1992
[LS92] Lenhof, H.-P., & Smid, M. (1992). Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity. Third Scandinavian Workshop on Algorithm Theory (SWAT) (pp. 388-398).
[LS92] Lenhof, H.-P., & Smid, M. (1992). Enumerating the k closest pairs optimally. Annual Symposium on Foundations of Computer Science (FOCS) (pp. 380-386).
1991
[LS91] Lenhof, H.-P., & Smid, M. (1991). An optimal construction method for generalized convex layers. International Symposium on Algorithms (ISA) (pp. 349-363).
