...
首页> 外文期刊>Information Processing Letters >Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
【24h】

Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint

机译:用于确定满足总和或平均约束的最长和最短段的最佳算法

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:我们研究了生物学序列分析引起的几个基本问​​题。给定一个实数序列,我们提出两种线性时间算法,一种用于定位“最长”和约束段,另一种用于定位“最短”和约束段。这两种算法基于相同的框架并以在线方式运行,因此它们能够处理数据流输入。我们的算法还提供在线线性时间解决方案,可通过简单归约来找到最长和最短的平均约束段。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号