Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions

DOI10.1007/978-3-031-20643-6_3zbMath1525.68207arXiv2207.04194OpenAlexW4312918225MaRDI QIDQ6166969

Hideo Bannai, Shunsuke Inenaga, Laurentius Leonard, Takuya Mieno

Publication date: 4 August 2023

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

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

zbMATH Keywords

pattern matchingsuffix arraysuffix treecounting algorithm

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Cites Work

• An algorithm for string matching with a sequence of don't cares
• On-line construction of suffix trees
• Online parameterized dictionary matching with one gap
• Online recognition of dictionary with one gap
• Parameterized dictionary matching and recognition with one gap
• Constructing suffix arrays in linear time
• Suffix Arrays: A New Method for On-Line String Searches
• Linear work suffix array construction
• Algorithms on Strings, Trees and Sequences
• Fast text searching for regular expressions or automaton searching on tries
• Combinatorial Pattern Matching
• Unnamed Item
• Unnamed Item

This page was built for publication: Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions