\(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity

DOI10.1016/j.jda.2017.10.005zbMath1390.68783OpenAlexW2767771833MaRDI QIDQ1748195

Matthias Gallé, Matías Tealdi

Publication date: 9 May 2018

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2017.10.005

zbMATH Keywords

suffix arrayrepeatsstringologytext algorithmsnatural-language processing

Mathematics Subject Classification ID

Natural language processing (68T50) Algorithms on strings (68W32)

Uses Software

• word2vec
• GloVe

Cites Work

• Searching for smallest grammars on large sequences and application to DNA
• Replacing suffix trees with enhanced suffix arrays
• The smallest automaton recognizing the subwords of a text
• On maximal repeats in strings
• The smallest grammar problem as constituents choice and minimal grammar parsing
• Average sizes of suffix trees and DAWGs
• On-line construction of suffix trees
• Learning deterministic context free grammars: the Omphalos competition
• Computing the Burrows-Wheeler transform of a string and its reverse in parallel
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Computing Inverse ST in Linear Complexity
• A Polynomial Algorithm for the Inference of Context Free Languages
• Introduction to Information Retrieval
• Algorithms on Strings, Trees and Sequences
• Spaces, Trees, and Colors
• On Context-Diverse Repeats and Their Incremental Computation

This page was built for publication: \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity