Efficient On-Line Construction and Correction of Position Trees

DOI10.1137/0209061zbMath0447.68072OpenAlexW2004052044MaRDI QIDQ3893328

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

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

Related Items

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