Fast Detection of Specific Fragments Against a Set of Sequences - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Fast Detection of Specific Fragments Against a Set of Sequences

Résumé

We design alignment-free techniques for comparing a sequence or word, called a target, against a set of words, called a reference. A target-specific factor of a target T against a reference R is a factor w of a word in T which is not a factor of a word of R and such that any proper factor of w is a factor of a word of R. We first address the computation of the set of target-specific factors of a target T against a reference R, where T and R are finite sets of sequences. The result is the construction of an automaton accepting the set of all considered target-specific factors. The construction algorithm runs in linear time according to the size of T∪R. The second result consists of the design of an algorithm to compute all the occurrences in a single sequence T of its target-specific factors against a reference R. The algorithm runs in real-time on the target sequence, independently of the number of occurrences of target-specific factors.

Dates et versions

hal-04492344 , version 1 (06-03-2024)

Identifiants

Citer

Marie-Pierre Béal, Maxime Crochemore. Fast Detection of Specific Fragments Against a Set of Sequences. DLT 2023, Jun 2023, Umeå, Sweden. pp.51-60, ⟨10.1007/978-3-031-33264-7_5⟩. ⟨hal-04492344⟩
7 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More