首页> 外文会议>Bioinformatics and Biomedicine (BIBM), 2007 IEEE International Conference on >SAIL-APPROX: An Efficient On-Line Algorithm for Approximate Pattern Matching with Wildcards and Length Constraints
【24h】

SAIL-APPROX: An Efficient On-Line Algorithm for Approximate Pattern Matching with Wildcards and Length Constraints

机译:SAIL-APPROX:一种有效的在线算法,用于通配符和长度约束的近似模式匹配

获取原文

摘要

Finding patterns in biological sequences owns a significant impact on many real-world applications such as biological sequence analysis, text indexing, stream data mining, and sensor networking. The problem of Pattern Matching with Wildcards and Length Co
机译:在生物序列中寻找模式对许多实际应用具有重大影响,例如生物序列分析,文本索引,流数据挖掘和传感器网络。带通配符和长度Co的模式匹配问题

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号