Efficient On-Line Construction and Correction of Position Trees

DOI10.1137/0209061MaRDI QIDQ3893328zbMATH OpenOpenAlexFDO

Authors M. E. Majster, Angelika Reiser

Publication date 1980

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/7507

zbMATH Keywords

on-line algorithmpattern matchingposition tree

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(5)

• The smallest automaton recognizing the subwords of a text
• Structural properties of the string statistics problem
• Time optimal left to right construction of position trees
• Average sizes of suffix trees and DAWGs
• Forty Years of Text Indexing

This page was built for publication: Efficient On-Line Construction and Correction of Position Trees

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