Sciweavers

6279 search results - page 1211 / 1256
» Studies in Solution Sampling
Sort
View
RECOMB
1997
Springer
14 years 2 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...
ICDT
2010
ACM
195views Database» more  ICDT 2010»
14 years 2 months ago
Answering Non-Monotonic Queries in Relational Data Exchange
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
André Hernich
AISB
1994
Springer
14 years 2 months ago
Formal Memetic Algorithms
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
Nicholas J. Radcliffe, Patrick D. Surry
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
14 years 2 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
FSTTCS
1992
Springer
14 years 2 months ago
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
Vikraman Arvind, Johannes Köbler, Martin Mund...
« Prev « First page 1211 / 1256 Last » Next »