Ukkonen's algorithm

id: ukkonen-s-algorithm-313-1293535
title: Ukkonen's algorithm
text: In computer science, Ukkonen's algorithm is a linear-time, online algorithm for constructing suffix trees, proposed by Esko Ukkonen in 1995. The algorithm begins with an implicit suffix tree containing the first character of the string. Then it steps through the string, adding successive characters until the tree is complete. This order addition of characters gives Ukkonen's algorithm its "on-line" property. The original algorithm presented by Peter Weiner proceeded backward from the last charac
brand slug: wiki
category slug: encyclopedia
description: Algorithm for construction of suffix trees
original url: https://en.wikipedia.org/wiki/Ukkonen%27s_algorithm
date created:
date modified: 2024-03-26T21:17:26Z
main entity: {"identifier":"Q7878334","url":"https://www.wikidata.org/entity/Q7878334"}
image:
fields total: 13
integrity: 14

Related Entries

Explore Next Part