Time optimal left to right construction of position trees

DOI10.1007/BF00292114MaRDI QIDQ1092659zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On-line construction of suffix trees
• Position heaps: a simple and dynamic text indexing data structure
• Suffix trees on words
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• scientific article; zbMATH DE number 1615290

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• A Space-Economical Suffix Tree Construction Algorithm
• Efficient On-Line Construction and Correction of Position Trees

Cited in

(9)

• scientific article; zbMATH DE number 1615290 (Why is no real title available?)
• Execution time analysis of a top-down R-tree construction algorithm
• Approximate string matching with suffix automata
• Linear bidirectional on-line construction of affix trees
• On-line construction of position heaps
• Forty Years of Text Indexing
• On-line construction of suffix trees
• New algorithms for position heaps
• Near real-time suffix tree construction via the fringe marked ancestor problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092659)