咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 4 篇 string factoriza...
  • 1 篇 string algorithm...
  • 1 篇 alphabet orderin...
  • 1 篇 repetitions
  • 1 篇 palindromes
  • 1 篇 runs
  • 1 篇 biosequences
  • 1 篇 np-complete prob...
  • 1 篇 equality-free
  • 1 篇 heuristics
  • 1 篇 lyndon words
  • 1 篇 permutations
  • 1 篇 duval's algorith...

机构

  • 2 篇 kyushu univ dept...
  • 1 篇 univ bucharest d...
  • 1 篇 aberystwyth univ...
  • 1 篇 natl inst res & ...
  • 1 篇 univ helsinki hi...
  • 1 篇 stellenbosch uni...
  • 1 篇 diego portales u...
  • 1 篇 nicholas coperni...
  • 1 篇 univ helsinki de...
  • 1 篇 kyushu univ dept...
  • 1 篇 swansea univ com...

作者

  • 2 篇 inenaga shunsuke
  • 1 篇 zarges christine
  • 1 篇 clare amanda
  • 1 篇 mora benjamin
  • 1 篇 kempa dominik
  • 1 篇 major lily
  • 1 篇 popa alexandru
  • 1 篇 mincu radu stefa...
  • 1 篇 yonemoto yuki
  • 1 篇 daykin jacquelin...
  • 1 篇 gagie travis
  • 1 篇 piatkowski marci...
  • 1 篇 bannai hideo
  • 1 篇 sugimoto shiho
  • 1 篇 gamboa leonel jo...
  • 1 篇 karkkainen juha

语言

  • 4 篇 英文
检索条件"主题词=String factorization"
4 条 记 录,以下是1-10 订阅
排序:
The Maximum Equality-Free string factorization Problem: Gaps vs. No Gaps  46th
The Maximum Equality-Free String Factorization Problem: Gaps...
收藏 引用
46th International Conference on Current Trends in Theory and Practice of Informatics (SOFSEM)
作者: Mincu, Radu Stefan Popa, Alexandru Univ Bucharest Dept Comp Sci Bucharest Romania Natl Inst Res & Dev Informat Bucharest Romania
A factorization of a string w is a partition of w into substrings u(1),..., u(k) such that w = u(1)u(2) ... u(k). Such a partition is called equality-free if no two factors are equal: u(i) not equal u(j), for all i, j... 详细信息
来源: 评论
Simple Linear-Time Repetition factorization  31st
Simple Linear-Time Repetition Factorization
收藏 引用
31st International Symposium on string Processing and Information Retrieval (SPIRE)
作者: Yonemoto, Yuki Inenaga, Shunsuke Kyushu Univ Dept Informat Sci & Technol Fukuoka Japan Kyushu Univ Dept Informat Fukuoka Japan
A factorization f(1),..., f(m) of a string w of length n is called a repetition factorization of w if f(i) is a repetition, i.e., f(i) is a form of x(k) x' where x is a non-empty string, x' is a (possibly-empt... 详细信息
来源: 评论
Diverse Palindromic factorization is NP-Complete
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2018年 第2期29卷 143-163页
作者: Bannai, Hideo Gagie, Travis Inenaga, Shunsuke Karkkainen, Juha Kempa, Dominik Piatkowski, Marcin Sugimoto, Shiho Kyushu Univ Dept Informat Fukuoka Japan Diego Portales Univ Santiago Chile Univ Helsinki Dept Comp Sci Helsinki Finland Univ Helsinki HIIT Helsinki Finland Nicholas Copernicus Univ Fac Math & Comp Sci Torun Poland
We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.
来源: 评论
Evaluation of a Permutation-Based Evolutionary Framework for Lyndon factorizations  16th
Evaluation of a Permutation-Based Evolutionary Framework for...
收藏 引用
16th International Conference on Parallel Problem Solving from Nature (PPSN)
作者: Major, Lily Clare, Amanda Daykin, Jacqueline W. Mora, Benjamin Gamboa, Leonel Jose Pena Zarges, Christine Aberystwyth Univ Dept Comp Sci Aberystwyth Dyfed Wales Stellenbosch Univ Dept Informat Sci Stellenbosch South Africa Swansea Univ Comp Sci Dept Swansea W Glam Wales
string factorization is an important tool for partitioning data for parallel processing and other algorithmic techniques often found in the context of big data applications such as bioinformatics or compression. Duval... 详细信息
来源: 评论