Constructing Antidictionaries of Long Texts in Output-Sensitive Space

A word x that is absent from a word y is called minimal if all its proper factors occur in y . Given a collection of k words y 1 , … , y k over an alphabet Σ , we are asked to compute the set M { y 1 , … , y k } ℓ of minimal absent words of length at most ℓ of the collection { y 1 , … , y k }. The s...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 65; no. 5; pp. 777 - 797
Main Authors:	Ayad, Lorraine A.K., Badkobeh, Golnaz, Fici, Gabriele, Héliou, Alice, Pissis, Solon P.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2021 Springer Nature B.V
Subjects:	Algorithms Alphabets Bioinformatics Computation Computer Science Data compression Genomes Theory of Computation String algorithm Output sensitive algorithm Absent word Antidictionary Data compression
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!