Preprint / Version 3

Longest common substring regarding the set of de Bruijn sequences

##article.authors##

  • Oscar Cabrera Independent Researcher

DOI:

https://doi.org/10.31224/3790

Keywords:

de bruijn, longest, common, substring, graph, sequences

Abstract

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-08-02

Versions

License

Copyright (c) 2024 Oscar Cabrera

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Version justification

Inserted lines 23-25 in algorithm 1, fixing a special case.