This is an outdated version published on 2024-07-02. Read the most recent version.
Preprint
/
Version 2
Longest common substring regarding the set of de Bruijn sequences
DOI:
https://doi.org/10.31224/3790Keywords:
de bruijn, longest, common, substring, graph, sequencesAbstract
An algorithm is presented in order to, given any alphabet of size k, compute the longest common substring (LCS) between a sequence S of length N and the whole set of de Bruijn sequences for that length, understood as the maximum value between all LCS of S respecting every sequence of the set.
Downloads
Download data is not yet available.
Downloads
Posted
2024-07-01 — Updated on 2024-07-02
Versions
- 2024-08-02 (3)
- 2024-07-02 (2)
- 2024-07-01 (1)
License
Copyright (c) 2024 Oscar Cabrera
This work is licensed under a Creative Commons Attribution 4.0 International License.
Version justification
Fixed the wrong expression (1) in definition 1.1.