咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 13 篇 工学
    • 12 篇 计算机科学与技术...
    • 2 篇 软件工程
    • 1 篇 控制科学与工程
    • 1 篇 生物工程
  • 8 篇 理学
    • 6 篇 数学
    • 2 篇 生物学
  • 1 篇 农学
    • 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 条 记 录,以下是1-10 订阅
排序:
New tabulation and sparse dynamic programming based techniques for sequence similarity problems
收藏 引用
DISCRETE APPLIED MATHEMATICS 2016年 第0期212卷 96-103页
作者: Grabowski, Szymon Lodz Univ Technol Inst Appl Comp Sci Al Politech 11 PL-90924 Lodz Poland
Calculating the length l of a longest common subsequence (LCS) of two strings, A of length n and B of length m, is a classic research topic, with many known worst-case oriented results. We present three algorithms for... 详细信息
来源: 评论
New tabulation and sparse dynamic programming based techniques for sequence similarity problems  18
New tabulation and sparse dynamic programming based techniqu...
收藏 引用
18th Prague Stringology Conference, PSC 2014
作者: Grabowski, Szymon Lodz University of Technology Institute of Applied Computer Science Al. Politechniki 11 Lódź90-924 Poland
Calculating the length of a longest common subsequence (LCS) of two strings, A of length n and B of length m, is a classic research topic, with many worstcase oriented results known. We present two algorithms for LCS ... 详细信息
来源: 评论
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... 详细信息
来源: 评论
The longest common subsequence problem for small alphabets in the word RAM model
收藏 引用
INFORMATION PROCESSING LETTERS 2025年 190卷
作者: Campos, Rodrigo Alexander Castro Univ Autonoma Metropolitana Dept Sistemas San Pablo 420 Mexico City 02200 Mexico
Given two strings of lengths m and n, with m <= n, the longest common subsequence problem consists of computing a common subsequence of maximum length by deleting symbols from both strings. While the O(mn) algorith... 详细信息
来源: 评论
Efficient algorithms for the longest common subsequence in k-length substrings
收藏 引用
INFORMATION PROCESSING LETTERS 2014年 第11期114卷 634-638页
作者: Deorowicz, Sebastian Grabowski, Szymon Silesian Tech Univ Inst Informat PL-44100 Gliwice Poland Lodz Univ Technol Inst Appl Comp Sci PL-90924 Lodz Poland
Finding the longest common subsequence in k-length substrings (LCSk) is a recently proposed problem motivated by computational biology. This is a generalization of the well-known LCS problem in which matching symbols ... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Fast algorithms for computing tree LCS
收藏 引用
THEORETICAL COMPUTER SCIENCE 2009年 第43期410卷 4303-4314页
作者: Mozes, Shay Tsur, Dekel Weimann, Oren Ziv-Ukelson, Michal Ben Gurion Univ Negev IL-84105 Beer Sheva Israel Brown Univ Providence RI 02912 USA MIT Cambridge MA 02139 USA
The LCS of two rooted, ordered, and labeled trees F and G is the largest forest that can be obtained from both trees by deleting nodes. We present algorithms for computing tree LCS which exploit the sparsity inherent ... 详细信息
来源: 评论
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance
收藏 引用
INFORMATION RETRIEVAL 2008年 第4期11卷 335-357页
作者: Fredriksson, Kimmo Grabowski, Szymon Univ Kuopio Dept Comp Sci FIN-70211 Kuopio Finland Tech Univ Lodz Dept Comp Engn PL-90924 Lodz Poland
We develop efficient dynamic programming algorithms for pattern matching with general gaps and character classes. We consider patterns of the form p(0) g(a(0),b(0))p(1)g(a(1),b(1)) ... p(m-1), where p(i) subset of Sig... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Peak alignment using restricted edit distances
收藏 引用
BIOMOLECULAR ENGINEERING 2007年 第3期24卷 337-342页
作者: Makinen, Veli Univ Helsinki Dept Comp Sci FIN-00014 Helsinki Finland
A peak is a pair of real values (x, y), where x is the time when peak of height y is registered. In the peak alignment problem, we are given two sequences of peaks, and our task is to align the sequences allowing some... 详细信息
来源: 评论