Tight Bound for the Number of Distinct Palindromes in a Tree-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Tight Bound for the Number of Distinct Palindromes in a Tree

Published:2015 Issue: Volume: Page:270-276
ISSN:0302-9743
Container-title:String Processing and Information Retrieval
language:
Short-container-title:

Author:

Gawrychowski Paweł,Kociumaka Tomasz,Rytter Wojciech,Waleń Tomasz

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-23826-5_26

Reference9 articles.

1. Anisiu, M., Anisiu, V., Kása, Z.: Total palindrome complexity of finite words. Discrete Mathematics 310(1), 109–114 (2010)

2. Brlek, S., Hamel, S., Nivat, M., Reutenauer, C.: On the palindromic complexity of infinite words. Int. J. Found. Comput. Sci. 15(2), 293–306 (2004)

3. Lecture Notes in Computer Science;S Brlek,2015

4. Lecture Notes in Computer Science;M Crochemore,2012

5. Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theor. Comput. Sci. 255(1–2), 539–553 (2001)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tight Bound for the Number of Distinct Palindromes in a Tree;The Electronic Journal of Combinatorics;2023-04-21

2. String Covers of a Tree Revisited;String Processing and Information Retrieval;2023

3. Enumeration of two dimensional palindromes;Information and Computation;2021-06

4. String Covers of a Tree;String Processing and Information Retrieval;2021

5. Lower Bounds for the Number of Repetitions in 2D Strings;String Processing and Information Retrieval;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP