A branch and bound algorithm for local multiple alignment.

研究成果: Article同行評審

7 引文 斯高帕斯(Scopus)


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.

頁(從 - 到)368-383
期刊Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
出版狀態Published - 1996 1月 1

All Science Journal Classification (ASJC) codes

  • 生物醫學工程
  • 計算機理論與數學


深入研究「A branch and bound algorithm for local multiple alignment.」主題。共同形成了獨特的指紋。