TY - JOUR
T1 - Real-time indexing over fixed finite alphabets
AU - Amir, Amihood
AU - Nor, Igor
PY - 2008/12/1
Y1 - 2008/12/1
N2 - The quest for a real-time indexing algorithm is over three decades old. To date there is no convincing understandable solution to this problem. This paper provides a real-time indexing algorithm over a constantsized alphabet. Assuming the text is arriving at a constant rate, the algorithm spends O(1) time on every text symbol. Whenever a length m pattern is given, the algorithm decides in time O(m) whether there is an occurrence of the pattern in the text thus far.
AB - The quest for a real-time indexing algorithm is over three decades old. To date there is no convincing understandable solution to this problem. This paper provides a real-time indexing algorithm over a constantsized alphabet. Assuming the text is arriving at a constant rate, the algorithm spends O(1) time on every text symbol. Whenever a length m pattern is given, the algorithm decides in time O(m) whether there is an occurrence of the pattern in the text thus far.
UR - http://www.scopus.com/inward/record.url?scp=58449108895&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
JO - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
JF - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
ER -