@inproceedings{a1f246abc52e42d7a20fa849d32f08df,

title = "Real-time indexing over fixed finite alphabets",

abstract = "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.",

keywords = "Pattern matching, Quasi real time, Real time, Suffix tree",

author = "Amihood Amir and Igor Nor",

year = "2008",

language = "אנגלית",

isbn = "9780898716474",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

pages = "1086--1095",

booktitle = "Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms",

note = "19th Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 20-01-2008 Through 22-01-2008",

}