Browse by Authors
Group by: Date | Item Type Jump to: Article | Conference or Workshop Item Number of items: 7. ArticleAlthaus, E. and Caprara, A. and Lenhof, H.-P. and Reinert, K. (2006) A Branch-and-Cut Algorithm for Multiple Sequence Alignment. Mathematical Programming (105). pp. 387-425. Kececioglu, J. D. and Lenhof, H.-P. and Mehlhorn, K. and Reinert, K. and Vingron, M. (2000) A Polyhedral Approach to Sequence Alignment Problems. Discrete Applied Mathematics, 104 . pp. 143-186. Lenhof, H.-P. and Morgenstern, B. and Reinert, K. (1999) An exact solution for the segment-to-segment multiple sequence alignment problem. BIOINFORMATICS, 15 (3). pp. 203-210. Lenhof, H.-P. and Reinert, K. and Vingron, M. (1998) A Polyhedral Approach to RNA Sequence Structure Alignment. Journal of Computational Biology, 5 (3). pp. 517-530. Conference or Workshop ItemAlthaus, E. and Caprara, A. and Lenhof, H.-P. and Reinert, K. (2002) Multiple Sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. In: Proceedings of the 1st European Conference on Computational Biology (ECCB 2002). Lenhof, H.-P. and Reinert, K. and Vingron, M. (1998) A polyhedral approach to RNA sequence structure alignment. In: Proceedings of the Second Annual International Conference on Computational Molecular Biology (RECOMB-98). Reinert, K. and Lenhof, H.-P. and Mutzel, P. and Kececioglu, J. D. (1997) A branch-and-Cut algorithm for multiple sequence alignment. In: Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB-97). |