Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space

A string \(w\) is said to be a minimal absent word (MAW) for a string \(S\) if \(w\) does not occur in \(S\) and any proper substring of \(w\) occurs in \(S\). We focus on non-trivial MAWs which are of length at least 2. Finding such non-trivial MAWs for a given string is motivated for applications...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-05
Hauptverfasser:	Inenaga, Shunsuke, Mieno, Takuya, Arimura, Hiroki, Funakoshi, Mitsuru, Fujishige, Yuta
Format:	Artikel
Sprache:	eng
Schlagworte:	Bioinformatics Data compression Data structures Strings
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!