TOP > Available Issues > Table of Contents > Abstract
| | ONLINE | ISSN | : | 1745-1361 | | PRINT | ISSN | : | 0916-8532 |
|
| | IEICE Transactions on Information and Systems |
| E91.D (2008) , No. 3 pp.789-795 |
| [PDF (2093K)] [References]  |  | Please click this button non-subscribers to purchase a paper individually. |
 | Near-Optimal Block Alignments
|
| | 1) Department of Computer Science and Engineering, National Sun Yat-sen University
2) The Institute of Electronics, Information and Communication Engineers |
| (Manuscript received: November 9, 2006)
|
| | SUMMARY The optimal alignment of two given biosequences is mathematically optimal, but it may not be a biologically optimal one. To investigate more possible alignments with biological meaning, one can relax the scoring functions to get near-optimal alignments. Though the near optimal alignments increase the possibility of finding the correct alignment, they may confuse the biologists because the size of candidates is large. In this paper, we present the filter scheme for the near-optimal alignments. An easy method for tracing the near-optimal alignments and an algorithm for filtering those alignments are proposed. The time complexity of our algorithm is O(dmn) in the worst case, where d is the maximum distance between the near-optimal alignments and the optimal alignment, and m and n are the lengths of the input sequences, respectively. |
| | | |
| Please click this button non-subscribers to purchase a paper individually. |
| To cite this article: | | Kuo-Tsung TSENG, Chang-Biau YANG, Kuo-Si HUANG and Yung-Hsing PENG, “Near-Optimal Block Alignments”, IEICE Trans. Inf. & Syst., Vol. E91.D, No. 3, pp.789-795, 2008 . | |
|
| doi:10.1093/ietisy/e91-d.3.789 | | JOI JST.JSTAGE/transinf/E91.D.789 |
| Copyright (c) 2010 The Institute of Electronics, Information and Communication Engineers |
|
|
