DOIAbstract
We prove that the multiple sequence alignment problem with weighted sum-of-pairs score is APX-hard for arbitrary metric scoring functions over the binary alphabet. This holds even when the weights are restricted to zero and one
We prove that the multiple sequence alignment problem with weighted sum-of-pairs score is APX-hard for arbitrary metric scoring functions over the binary alphabet. This holds even when the weights are restricted to zero and one
Accepted for publication in Journal of Computational Biology Alignment of sequences is an important ...
[[abstract]]Imposing constraints is a way to incorporate information into the sequence alignment pro...
Abstract. We study the complexity of approximating solution structure of the bijective weighted sent...
We prove that the multiple sequence alignment problem with weighted sum-of-pairs score is APX-hard f...
AbstractWe consider a weighted generalization of multiple sequence alignment (MSA) with sum-of-pair ...
We consider a weighted generalization of multiple sequence alignment (MSA) with sum-of-pair score. M...
AbstractThis paper analyzes the computational complexity of computing the optimal alignment of a set...
AbstractWe consider the problem of aligning of k sequences of length n. The cost function is sum of ...
Stoye J, Perrey SW, Dress A. Improving the divide-and-conquer approach to sum-of-pairs multiple sequ...
Abstract. In this paper some of the most fundamental problems in computational biology are proved in...
AbstractWe consider the problem of multiple sequence alignment: given k sequences of length at most ...
In this paper some of the most fundamental problems in computational biology are proved intractable....
The Constrained Multiple Sequence Alignment problem is to align a set of sequences subject to a give...
AbstractImposing constraints is a way to incorporate information into the sequence alignment procedu...
The Constrained Multiple Sequence Alignment problem is to align a set of sequences subject to a give...
Accepted for publication in Journal of Computational Biology Alignment of sequences is an important ...
[[abstract]]Imposing constraints is a way to incorporate information into the sequence alignment pro...
Abstract. We study the complexity of approximating solution structure of the bijective weighted sent...
We prove that the multiple sequence alignment problem with weighted sum-of-pairs score is APX-hard f...
AbstractWe consider a weighted generalization of multiple sequence alignment (MSA) with sum-of-pair ...
We consider a weighted generalization of multiple sequence alignment (MSA) with sum-of-pair score. M...
AbstractThis paper analyzes the computational complexity of computing the optimal alignment of a set...
AbstractWe consider the problem of aligning of k sequences of length n. The cost function is sum of ...
Stoye J, Perrey SW, Dress A. Improving the divide-and-conquer approach to sum-of-pairs multiple sequ...
Abstract. In this paper some of the most fundamental problems in computational biology are proved in...
AbstractWe consider the problem of multiple sequence alignment: given k sequences of length at most ...
In this paper some of the most fundamental problems in computational biology are proved intractable....
The Constrained Multiple Sequence Alignment problem is to align a set of sequences subject to a give...
AbstractImposing constraints is a way to incorporate information into the sequence alignment procedu...
The Constrained Multiple Sequence Alignment problem is to align a set of sequences subject to a give...
Accepted for publication in Journal of Computational Biology Alignment of sequences is an important ...
[[abstract]]Imposing constraints is a way to incorporate information into the sequence alignment pro...
Abstract. We study the complexity of approximating solution structure of the bijective weighted sent...
Add to ORKG