We describe a branch-and-bound search algorithm for finding the exact1Artificial Intelligence global optimum gapped sequence-structure alignment (‘‘threading’’)Laboratory, Massachusetts between a protein sequence and a protein core or structural model, usingInstitute of Technology an arbitrary amino acid pair score function (e.g. contact potentials,Cambridge, MA 02139, USA knowledge-based potentials, potentials of mean force, etc.). The search2BioMolecular Engineering method imposes minimal conditions on how structural environments are Research Center defined or the form of the score function, and allows arbitrar
Proteins are long sequences of amino acids which can be represented abstractly as words of single le...
We propose new empirical scoring potentials and associated alignment procedures for optimally aligni...
Protein structural alignment is an important problem in computational biology. In this paper, we pre...
We describe a branch-and-bound search algorithm for finding the exact1Artificial Intelligence global...
This paper describes a novel anytime branch-and-bound or best-first threading search algorithm for g...
Conventionally, protein structure prediction via threading relies on some nonoptimal method to align...
Conventionally, protein structure prediction via "threading" relies on some non-optimal me...
In recent protein structure prediction research there has been a great deal of interest in using ami...
Computational protein threading is a powerful technique for recognizing native-like folds of a prote...
Various bioinformatics problems require optimizing several different properties simultaneously. For ...
We developed a combinatorial search algorithm which we call best profile search for the global optim...
Advances in molecular biology may mean that almost any protein sequence can be synthesised, but perh...
International audienceThis paper describes a new algorithm that expands upon algorithms proposed in ...
Various bioinformatics problems require optimizing several different properties simultaneously. For ...
As a basic tool of modern biology, sequence alignment can provide us useful information in fold, fun...
Proteins are long sequences of amino acids which can be represented abstractly as words of single le...
We propose new empirical scoring potentials and associated alignment procedures for optimally aligni...
Protein structural alignment is an important problem in computational biology. In this paper, we pre...
We describe a branch-and-bound search algorithm for finding the exact1Artificial Intelligence global...
This paper describes a novel anytime branch-and-bound or best-first threading search algorithm for g...
Conventionally, protein structure prediction via threading relies on some nonoptimal method to align...
Conventionally, protein structure prediction via "threading" relies on some non-optimal me...
In recent protein structure prediction research there has been a great deal of interest in using ami...
Computational protein threading is a powerful technique for recognizing native-like folds of a prote...
Various bioinformatics problems require optimizing several different properties simultaneously. For ...
We developed a combinatorial search algorithm which we call best profile search for the global optim...
Advances in molecular biology may mean that almost any protein sequence can be synthesised, but perh...
International audienceThis paper describes a new algorithm that expands upon algorithms proposed in ...
Various bioinformatics problems require optimizing several different properties simultaneously. For ...
As a basic tool of modern biology, sequence alignment can provide us useful information in fold, fun...
Proteins are long sequences of amino acids which can be represented abstractly as words of single le...
We propose new empirical scoring potentials and associated alignment procedures for optimally aligni...
Protein structural alignment is an important problem in computational biology. In this paper, we pre...