Polynomial-Delay Enumeration of Maximal Common Subsequences - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Polynomial-Delay Enumeration of Maximal Common Subsequences

(1) , (1, 2) , (3) , (4)
1
2
3
4

Abstract

A Maximal Common Subsequence (MCS) between two strings X and Y is an inclusion-maximal subsequence of both X and Y. MCSs are a natural generalization of the classical concept of Longest Common Subsequence (LCS), which can be seen as a longest MCS. We study the problem of efficiently listing all the distinct MCSs between two strings. As discussed in the paper, this problem is algorithmically challenging as the same MCS cannot be listed multiple times: for example, dynamic programming [Fraser et al., CPM 1998] incurs in an exponential waste of time, and a recent algorithm for finding an MCS [Sakai, CPM 2018] does not seem to immediately extend to listing. We follow an alternative and novel graph-based approach, proposing the first output-sensitive algorithm for this problem: it takes polynomial time in n per MCS found, where n = max{|X|, |Y |}, with polynomial preprocessing time and space.
Fichier principal
Vignette du fichier
paper43.pdf (345.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02338437 , version 1 (30-10-2019)

Identifiers

Cite

Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno. Polynomial-Delay Enumeration of Maximal Common Subsequences. SPIRE 2019 - 26th International Symposium on String Processing and Information Retrieval, Oct 2019, Segovia, Spain. pp.189-202, ⟨10.1007/978-3-030-32686-9_14⟩. ⟨hal-02338437⟩

Collections

INRIA INRIA2
45 View
115 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More