A time and space efficient data structure for string searching on large texts

DOI10.1016/0020-0190(96)00061-0zbMath0875.68308OpenAlexW2003608043WikidataQ126470086 ScholiaQ126470086MaRDI QIDQ1349954

Livio Colussi, Alessia De Col

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00061-0

zbMATH Keywords

AlgorithmsData structuresString matching

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (1)

Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays

Cites Work

• Suffix Arrays: A New Method for On-Line String Searches
• A Space-Economical Suffix Tree Construction Algorithm
• Unnamed Item
• Unnamed Item

This page was built for publication: A time and space efficient data structure for string searching on large texts