Discovering subword associations in strings in time linear in the output size

DOI10.1016/j.jda.2007.02.003zbMath1184.68368OpenAlexW2035160567MaRDI QIDQ1026231

Alberto Apostolico, Giorgio Satta

Publication date: 24 June 2009

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

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

zbMATH Keywords

association rulepattern matchingstring searchingsubstring statisticssubword treetandem index

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Gapped indexing for consecutive occurrences ⋮ Irredundant tandem motifs

Cites Work

• The smallest automaton recognizing the subwords of a text
• On-line construction of suffix trees
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• 10.1162/153244303322533197
• Discovery Science
• Discovery Science
• Simple and flexible detection of contiguous repeats using a suffix tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Discovering subword associations in strings in time linear in the output size