PubMed · 9390244
A branch and bound algorithm for local multiple alignment.
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
P Horton. 1996. A branch and bound algorithm for local multiple alignment.. https://pubmed.health/record/pubmed%3A9390244/a-branch-and-bound-algorithm-for-local-multiple-alignment
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite PubMed Health by Indiciae: BibTeX · RIS.