咨询与建议

限定检索结果

文献类型

  • 1 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 1 篇 工学
    • 1 篇 计算机科学与技术...

主题

  • 1 篇 string algorithm...
  • 1 篇 parallel algorit...
  • 1 篇 longest common s...
  • 1 篇 divide-and-conqu...
  • 1 篇 parallel braid m...
  • 1 篇 braid multiplica...
  • 1 篇 bitparallel algo...
  • 1 篇 dynamic programm...
  • 1 篇 semi-local strin...

机构

  • 1 篇 jetbrains res pr...
  • 1 篇 st petersburg st...

作者

  • 1 篇 berezun daniil
  • 1 篇 tiskin alexander
  • 1 篇 mishin nikita

语言

  • 1 篇 英文
检索条件"主题词=bitparallel algorithms"
1 条 记 录,以下是1-10 订阅
排序:
Efficient Parallel algorithms for String Comparison  21
Efficient Parallel Algorithms for String Comparison
收藏 引用
50th International Conference on Parallel Processing (ICPP)
作者: Mishin, Nikita Berezun, Daniil Tiskin, Alexander St Petersburg State Univ St Petersburg Russia JetBrains Res Prague Czech Republic
The longest common subsequence (LCS) problem on a pair of strings is a classical problem in string algorithms. Its extension, the semilocal LCS problem, provides a more detailed comparison of the input strings, withou... 详细信息
来源: 评论