The following pages link to Hans-Peter Lenhof (Q1585326):
Displayed 15 items.
- (Q1346774) (redirect page) (← links)
- Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity (Q1346775) (← links)
- A polyhedral approach to sequence alignment problems (Q1585327) (← links)
- A branch-and-cut algorithm for multiple sequence alignment (Q2583133) (← links)
- Integer Linear Programming in Computational Biology (Q3644723) (← links)
- (Q4230362) (← links)
- AN OPTIMAL CONSTRUCTION METHOD FOR GENERALIZED CONVEX LAYERS (Q4294714) (← links)
- Using persistent data structures for adding range restrictions to searching problems (Q4362274) (← links)
- (Q4398382) (← links)
- SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM (Q4848833) (← links)
- Static and Dynamic Algorithms for k-Point Clustering Problems (Q4857543) (← links)
- Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity (Q5056157) (← links)
- Static and dynamic algorithms for k-point clustering problems (Q5060119) (← links)
- Efficient Interpretation of Tandem Mass Tags in Top-Down Proteomics (Q5398397) (← links)
- Rapid software prototyping in molecular modeling using the biochemical algorithms library (BALL) (Q5463412) (← links)