咨询与建议

限定检索结果

文献类型

  • 13 篇 期刊文献
  • 3 篇 会议

馆藏范围

  • 16 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 13 篇 工学
    • 12 篇 计算机科学与技术...
    • 2 篇 软件工程
    • 1 篇 控制科学与工程
    • 1 篇 生物工程
  • 8 篇 理学
    • 6 篇 数学
    • 2 篇 生物学
  • 2 篇 农学
    • 1 篇 作物学
  • 1 篇 管理学
    • 1 篇 图书情报与档案管...

主题

  • 16 篇 sparse dynamic p...
  • 4 篇 longest common s...
  • 3 篇 transposition in...
  • 2 篇 string matching
  • 2 篇 sequence similar...
  • 2 篇 computational bi...
  • 2 篇 tabulation
  • 2 篇 edit distance
  • 1 篇 text categorizat...
  • 1 篇 largest common s...
  • 1 篇 string kernels
  • 1 篇 range-minimum se...
  • 1 篇 transformational...
  • 1 篇 kernel methods
  • 1 篇 algorithms
  • 1 篇 music retrieval
  • 1 篇 bounded gaps
  • 1 篇 bioinforrnatics
  • 1 篇 sequence to grap...
  • 1 篇 bit-parallelism

机构

  • 2 篇 univ helsinki de...
  • 2 篇 tech univ lodz d...
  • 1 篇 univ london roya...
  • 1 篇 nile univ ctr in...
  • 1 篇 univ chile dept ...
  • 1 篇 oxford brookes u...
  • 1 篇 lodz univ techno...
  • 1 篇 univ helsinki de...
  • 1 篇 univ copenhagen ...
  • 1 篇 univ autonoma me...
  • 1 篇 univ kuopio dept...
  • 1 篇 mit cambridge ma...
  • 1 篇 silesian tech un...
  • 1 篇 中科院上海生物化...
  • 1 篇 univ helsinki de...
  • 1 篇 univ joensuu dep...
  • 1 篇 univ southampton...
  • 1 篇 lodz university ...
  • 1 篇 univ oxford prog...
  • 1 篇 lodz univ techno...

作者

  • 5 篇 grabowski szymon
  • 3 篇 makinen veli
  • 2 篇 fredriksson kimm...
  • 1 篇 tang haixu
  • 1 篇 lemstrom kjell
  • 1 篇 navarro g
  • 1 篇 mohamed hisham
  • 1 篇 tsur dekel
  • 1 篇 rizzo nicola
  • 1 篇 shawe-taylor j
  • 1 篇 gibbons j
  • 1 篇 weimann oren
  • 1 篇 rousu j
  • 1 篇 abouelhoda moham...
  • 1 篇 caceres manuel
  • 1 篇 thorup m
  • 1 篇 deorowicz sebast...
  • 1 篇 de moor o
  • 1 篇 mozes shay
  • 1 篇 ukkonen e

语言

  • 12 篇 英文
  • 4 篇 其他
检索条件"主题词=sparse dynamic programming"
16 条 记 录,以下是11-20 订阅
排序:
Bridging the algorithm gap: A linear-time functional program for paragraph formatting
收藏 引用
SCIENCE OF COMPUTER programming 1999年 第1期35卷 3-27页
作者: de Moor, O Gibbons, J Univ Oxford Programming Res Grp Oxford OX1 3QD England Oxford Brookes Univ Sch Comp & Math Sci Oxford OX3 0BP England
In the constructive programming community it is commonplace to see formal developments of textbook algorithms. In the algorithm design community, on the other hand, it may be well known that the textbook solution to a... 详细信息
来源: 评论
Efficient algorithms for (δ, γ, α) and (δ, kΔ, α)-matching
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2008年 第1期19卷 163-183页
作者: Fredriksson, Kimmo Grabowski, Szymon Univ Joensuu Dept Comp Sci & Stat FIN-80101 Joensuu Finland Tech Univ Lodz Dept Comp Engn PL-90924 Lodz Poland
We propose new algorithms for (delta, gamma, alpha)-matching. In this string matching problem we axe given a pattern P = p(0)p(1)...p(m-1) and a text T = t(0)t(1)...t(n-1) over some integer alphabet Sigma = {0...sigma... 详细信息
来源: 评论
Chaining of Maximal Exact Matches in Graphs  30th
Chaining of Maximal Exact Matches in Graphs
收藏 引用
30th International Symposium on String Processing and Information Retrieval (SPIRE) / 18th Workshop on Compression, Text, and Algorithms (WCTA)
作者: Rizzo, Nicola Caceres, Manuel Makinen, Veli Univ Helsinki Dept Comp Sci POB 68Pietari Kalmin Katu 5 Helsinki 00014 Finland
We show how to chain maximal exact matches (MEMs) between a query string Q and a labeled directed acyclic graph (DAG) G = (V, E) to solve the longest common subsequence (LCS) problem between Q and G. We obtain our res... 详细信息
来源: 评论
Parallel Chaining Algorithms
Parallel Chaining Algorithms
收藏 引用
17th European MPI Users Group Meeting
作者: Abouelhoda, Mohamed Mohamed, Hisham Nile Univ Ctr Informat Sci Giza Egypt
Given a set of weighted hyper-rectangles in a k-dimensional space, the chaining problem is to identify a set of colinear and non-overlapping hyper-rectangles of total maximal weight. This problem is used in a number o... 详细信息
来源: 评论
Large-Scale Comparison Analysis of Genome Sequences
收藏 引用
生物数学学报 1997年 第2期12卷 97-103页
作者: Tang Haixu Ding Dafu(Shanghai Institute of Biochemistry,Academia Sinica Shanhai 200031) 中科院上海生物化学所 上海
Here we reported a new mothod for large-scale sequence *** it,we could get a approximate but accurate enough global or local alignment *** the method,sparse dynamic programming was used to refine the alignment space,t... 详细信息
来源: 评论
On minimizing pattern splitting in multi-track string matching
收藏 引用
JOURNAL OF DISCRETE ALGORITHMS 2005年 第2-4期3卷 248-266页
作者: Lemstrom, Kjell Makinen, Veli Univ Helsinki Dept Comp Sci POB 68Gustav Hallstromin Katu 2b FIN-00014 Helsinki Finland
Given a pattern string P = p1p2 ... pm and K parallel text strings T = {T-k = t(1)(k) ... t(n)(k) |1 0 such that P can be split into kappa pieces P = P-1 ... P-kappa, where each P-i has an occurrence in some text tra... 详细信息
来源: 评论