Sciweavers

224 search results - page 8 / 45
» The Complexity of Phrase Alignment Problems
Sort
View
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 11 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
RECOMB
1997
Springer
14 years 3 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...
COCOA
2007
Springer
14 years 5 months ago
A New Dynamic Programming Algorithm for Multiple Sequence Alignment
Abstract. Multiple sequence alignment (MSA) is one of the most basic and central tasks for many studies in modern biology. In this paper, we present a new progressive alignment alg...
Jean-Michel Richer, Vincent Derrien, Jin-Kao Hao
CIS
2004
Springer
14 years 4 months ago
Algorithms for Loosely Constrained Multiple Sequence Alignment
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
Bin Song, Fengfeng Zhou, Guoliang Chen
DEXA
2007
Springer
150views Database» more  DEXA 2007»
14 years 5 months ago
Sequence Alignment as a Database Technology Challenge
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...
Hans Philippi