Pattern Matching on Elastic-Degenerate Text with Errors - Archive ouverte HAL Access content directly
Conference Papers Year :

Pattern Matching on Elastic-Degenerate Text with Errors

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

Abstract

An elastic-degenerate string is a sequence of n sets of strings of total length N. It has been introduced to represent a multiple alignment of several closely-related sequences (e.g. pan-genome) compactly. In this representation, substrings of these sequences that match exactly are collapsed, while in positions where the sequences differ, all possible variants observed at that location are listed. The natural problem that arises is finding all matches of a deterministic pattern of length m in an elastic-degenerate text. There exists an O(nm 2 + N)-time algorithm to solve this problem on-line after a pre-processing stage with time and space O(m). In this paper, we study the same problem under the edit distance model and present an O(k 2 mG + kN)-time and O(m)-space algorithm, where G is the total number of strings in the elastic-degenerate text and k is the maximum edit distance allowed. We also present a simple O(kmG + kN)-time and O(m)-space algorithm for Hamming distance.
Fichier principal
Vignette du fichier
SPIRE2017.pdf (355.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01673585 , version 1 (30-12-2017)

Identifiers

Cite

Giulia Bernardini, Nadia Pisanti, Solon Pissis, Giovanna Rosone. Pattern Matching on Elastic-Degenerate Text with Errors. SPIRE 2017 - 24th International Symposium on String Processing and Information Retrieval, Sep 2017, Palermo, Italy. pp.74-90, ⟨10.1007/978-3-319-67428-5_7⟩. ⟨hal-01673585⟩

Collections

INRIA INRIA2
72 View
198 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More