Linear-Time Sequence Comparison Using Minimal Absent Words & Applications

DOI10.1007/978-3-662-49529-2_25zbMath1475.68467arXiv1506.04917OpenAlexW749316281MaRDI QIDQ2802951

Solon P. Pissis, Robert Mercaş, Maxime Crochemore, Gabriele Fici

Publication date: 3 May 2016

Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.04917

zbMATH Keywords

circular wordssequence comparisonalgorithms on stringsforbidden wordsabsent wordsalignment-free comparison

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (5)

Distinct Squares in Circular Words ⋮ Minimal forbidden factors of circular words ⋮ Alignment-free sequence comparison using absent words ⋮ Absent words in a sliding window with applications ⋮ Unnamed Item

This page was built for publication: Linear-Time Sequence Comparison Using Minimal Absent Words & Applications