A tiling bound for pairwise global sequence alignment

Brice Horton Ii Paul, Martin Frith

研究成果: Conference contribution

摘要

In this paper we motivate the need to develop new techniques to accelerate pairwise global sequence alignment and then propose a tiling bound to achieve this. The bounds involve a problem relaxation in which alignment scores of sequence fragments are combined to give a bound on the distance of any alignment passing through any particular point in the edit graph. We prove the correctness of the bound and briefly discuss possible implementation strategies.

原文English
主出版物標題Advances in Software Engineering
主出版物子標題International Conference, ASEA 2008, and Its Special Sessions, Sanya, Hainan Island, China, December 13-15, 2008. Revised Selected Papers
編輯Tai-hoon Kim, Wai Chi Fang, Changhoon Lee, Kirk P. Arnett
頁面93-98
頁數6
DOIs
出版狀態Published - 2009 十二月 1

出版系列

名字Communications in Computer and Information Science
30
ISSN(列印)1865-0929

All Science Journal Classification (ASJC) codes

  • 電腦科學(全部)
  • 數學(全部)

指紋

深入研究「A tiling bound for pairwise global sequence alignment」主題。共同形成了獨特的指紋。

引用此