Time optimal left to right construction of position trees

DOI10.1007/BF00292114zbMath0627.68039OpenAlexW2085735795MaRDI QIDQ1092659

B. George

Publication date: 1987

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00292114

zbMATH Keywords

on-line algorithmsmultiple pattern matchingdesign and analysis of algorithmscomplexity of algorithmsalgorithm for the on-line construction of position treesdata strutureinfix treestail node

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

On-line construction of suffix trees ⋮ Approximate string matching with suffix automata ⋮ Forty Years of Text Indexing

Cites Work

• Efficient On-Line Construction and Correction of Position Trees
• A Space-Economical Suffix Tree Construction Algorithm
• Unnamed Item

This page was built for publication: Time optimal left to right construction of position trees