咨询与建议

限定检索结果

文献类型

  • 2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 2 篇 工学
    • 2 篇 计算机科学与技术...
    • 1 篇 软件工程
  • 1 篇 理学
    • 1 篇 数学

主题

  • 2 篇 combinatorics on...
  • 1 篇 pattern matching
  • 1 篇 period of a stri...
  • 1 篇 substring statis...
  • 1 篇 repetition in a ...
  • 1 篇 unbordered facto...
  • 1 篇 augmented suffix...
  • 1 篇 suffix tree
  • 1 篇 design and analy...
  • 1 篇 borders

机构

  • 1 篇 univ warsaw inst...
  • 1 篇 bar ilan univ de...
  • 1 篇 brown univ dept ...
  • 1 篇 univ copenhagen ...
  • 1 篇 dalhousie univ f...
  • 1 篇 tech univ denmar...
  • 1 篇 univ padua dipar...

作者

  • 1 篇 kociumaka tomasz
  • 1 篇 knudsen mathias ...
  • 1 篇 cording patrick ...
  • 1 篇 apostolico a
  • 1 篇 gagie travis
  • 1 篇 preparata fp

语言

  • 2 篇 英文
检索条件"主题词=combinatorics on strings"
2 条 记 录,以下是1-10 订阅
排序:
Maximal unbordered factors of random strings
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 852卷 78-83页
作者: Cording, Patrick Hagge Gagie, Travis Knudsen, Mathias Baek Tejs Kociumaka, Tomasz Tech Univ Denmark DTU Compute Lyngby Denmark Dalhousie Univ Fac Comp Sci Halifax NS Canada Univ Copenhagen Dept Comp Sci Copenhagen Denmark Bar Ilan Univ Dept Comp Sci Ramat Gan Israel Univ Warsaw Inst Informat Warsaw Poland
A border of a string is a non-empty prefix of the string that is also a suffix of the string, and a string is unbordered if it has no border other than itself. Loptev, Kucherov, and Starikovskaya [CPM'15] conjectu... 详细信息
来源: 评论
Data structures and algorithms for the string statistics problem
收藏 引用
ALGORITHMICA 1996年 第5期15卷 481-494页
作者: Apostolico, A Preparata, FP UNIV PADUA DIPARTIMENTO ELETTRON & INFORMATI-35131 PADUAITALY BROWN UNIV DEPT COMP SCIPROVIDENCERI 02912
Given a textstring x of length n, the Minimal Augmented Suffix Tree (T) over cap (x) of x is a digital-search index that returns, for any query string w and in a number of comparisons bounded by the length of w, the m... 详细信息
来源: 评论