Related Experiment Video
Updated: Aug 17, 2026

A Practical Guide to Phylogenetics for Nonexperts
Published on: February 6, 2014
A branch and bound algorithm for local multiple alignment
1Computer Science Division, University of California, Berkeley 94720, USA.
Abstract:
A Branch and Bound Algorithm has been developed to find a set of window positions in a compilation of sequences with globally maximal information content. We have also developed an algorithm for brute force evaluation of solutions which is faster by a factor of the length of the windows than the naïve brute force algorithm. The combination of these two algorithms allows us to solve problems to optimality that were previously amenable only to heuristic algorithms.
Related Concept Videos
Conservation of Protein Domains Over Different Proteins
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...
Conserved Binding Sites
Binding sites are often located in large pockets, and if their location on a protein’s surface is unknown, it can be predicted using various approaches. The energetic method computationally analyses the...
Ligand Binding and Linkage
Ligand Binding and Linkage
Conserved Binding Sites
Binding sites are often located in large pockets, and if their location on a protein’s surface is unknown, it can be predicted using various approaches. The energetic method computationally analyses the...
Modern Molecular Taxonomy

