Exact algorithms for the bounded repetition longest common subsequence problem

DOI10.1007/978-3-030-36412-0_1MaRDI QIDQ2180128zbMATH OpenOpenAlexFDO

Authors Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima, Guohui Lin

Publication date 13 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-36412-0_1

Mathematics Subject Classification ID

Algorithms on strings (68W32) Analysis of algorithms (68W40)

Recommendations

• Exact algorithms for the repetition-bounded longest common subsequence problem
• Better heuristic algorithms for the repetition free LCS and other variants
• Repetition-free longest common subsequence
• Repetition-free longest common subsequence
• On the parameterized complexity of the repetition free longest common subsequence problem

Cited in

(7)

• Exact algorithms for the repetition-bounded longest common subsequence problem
• Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
• On the use of decision diagrams for finding repetition-free longest common subsequences
• Repetition-free longest common subsequence of random sequences
• On the parameterized complexity of the repetition free longest common subsequence problem
• String Processing and Information Retrieval
• Better heuristic algorithms for the repetition free LCS and other variants

This page was built for publication: Exact algorithms for the bounded repetition longest common subsequence problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180128)