The longest letter-duplicated subsequence and related problems

DOI10.1007/s00236-024-00459-7MaRDI QIDQ6592112

Wenfeng Lai, Peng Zou, Adiesha Liyanage, Binhai Zhu

Publication date: 24 August 2024

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regularity of languages generated by copying systems
• On the regularity of languages on a binary alphabet generated by copying systems
• The tandem duplication distance problem is hard over bounded alphabets
• 2726. A problem on strings of beads
• Computing the Tandem Duplication Distance is NP-Hard
• String Processing and Information Retrieval
• The longest run subsequence problem

This page was built for publication: The longest letter-duplicated subsequence and related problems