Sciweavers

154 search results - page 1 / 31
» A polyhedral approach to sequence alignment problems
Sort
View
DAM
2000
61views more  DAM 2000»
13 years 7 months ago
A polyhedral approach to sequence alignment problems
John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlho...
RECOMB
1998
Springer
13 years 11 months ago
A polyhedral approach to RNA sequence structure alignment
Ribonucleic acid (RNA) is a polymer composed of four bases denoted A, C, G, and U. It is a generally single-stranded molecule where the bases form hydrogen bonds within the same m...
Hans-Peter Lenhof, Knut Reinert, Martin Vingron
RECOMB
1997
Springer
13 years 11 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
ROBOTICA
2008
100views more  ROBOTICA 2008»
13 years 7 months ago
A symbolic approach to polyhedral scene analysis by parametric calotte propagation
Polyhedral scene analysis studies whether a 2D line drawing of a 3D polyhedron is realizable in the space, and if so, parameterizing the space of all possible realizations. For gen...
Hongbo Li, Lina Zhao, Ying Chen
COCOA
2007
Springer
14 years 1 months ago
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
Ernst Althaus, Stefan Canzar