scientific article; zbMATH DE number 3954313

MaRDI QIDQ3723739zbMATH OpenFDO

Authors Alberto Apostolico

Publication date 1979

zbMATH Keywords

analysis of algorithmscontext searchfrequencyoff-line algorithmspattern matchingperiod of a stringsubstringsuffix trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20) Artificial intelligence (68T99)

Recommendations

• Structural properties of the string statistics problem
• Data structures and algorithms for the string statistics problem
• On-line construction of suffix trees
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• scientific article; zbMATH DE number 1003303

Cited in

(10)

• The smallest automaton recognizing the subwords of a text
• Structural properties of the string statistics problem
• A new distance metric on strings computable in linear time
• Foreword: Algorithms, strings and theoretical approaches in the big data era -- special issue in honor of the 60th birthday of Professor Raffaele Giancarlo
• Data structures and algorithms for the string statistics problem
• Algorithms on strings. Translated from the 2001 French original
• scientific article; zbMATH DE number 3896283 (Why is no real title available?)
• scientific article; zbMATH DE number 2086666 (Why is no real title available?)
• Fast matching statistics in small space
• Negative selection algorithms on strings with efficient training and linear-time classification

This page was built for publication:

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