https://scholars.lib.ntu.edu.tw/handle/123456789/315309
標題: | Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint | 作者: | Chen, K.-Y. KUN-MAO CHAO |
關鍵字: | Algorithms; Longest segment; Sequence analysis; Shortest segment | 公開日期: | 2005 | 卷: | 96 | 期: | 6 | 起(迄)頁: | 197-201 | 來源出版物: | Information Processing Letters | 摘要: | We study several fundamental problems arising from biological sequence analysis. Given a sequence of real numbers, we present two linear-time algorithms, one for locating the "longest" sum-constrained segment, and the other for locating the "shortest" sum-constrained segment. These two algorithms are based on the same framework and run in an online manner, hence they are capable of handling data stream inputs. Our algorithms also yield online linear-time solutions for finding the longest and shortest average-constrained segments by a simple reduction. © 2005 Elsevier B.V. All rights reserved. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-27644536221&doi=10.1016%2fj.ipl.2005.08.006&partnerID=40&md5=f94e07e5dfd29fa3ce016b76848e726e http://scholars.lib.ntu.edu.tw/handle/123456789/315309 |
ISSN: | 00200190 | DOI: | 10.1016/j.ipl.2005.08.006 |
顯示於: | 生醫電子與資訊學研究所 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。