We contribute a further step towards the plausible real time construction of suffix trees by presenting an on-line algorithm that spends O(log log n) time processing each input symbol and takes O(n log log n) time in total. Our results improve on a previously published algorithm that take O(log n) time per symbol and O(n log n) time in total. The improvements are achieved using a new data structure for the fringe marked ancestor problem, a special case of the nearest marked ancestor problem, which may be of independent interest. © 2011 Springer-Verlag.
CITATION STYLE
Breslauer, D., & Italiano, G. F. (2011). Near real-time suffix tree construction via the fringe marked ancestor problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7024 LNCS, pp. 156–167). https://doi.org/10.1007/978-3-642-24583-1_16
Mendeley helps you to discover research relevant for your work.