Skip to search formSkip to main contentSkip to account menu

Ukkonen's algorithm

Known as: Ukkonen algorithm 
In computer science, Ukkonen's algorithm is a linear-time, online algorithm for constructing suffix trees, proposed by Esko Ukkonen in 1995. The… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Computer scienceGeneralized suffix treeList of algorithmsOnline algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Fast point-to-point Dyck constrained shortest paths on a DAG (Extended abstract)
Many aspects of program analysis are related to CFL (context-free language) constrained path problems on graphs. A path is… 
2014
2014
An Efficient Suffix Tree Reconstructing Algorithm for Biological Sequence Analysis
Abstract This paper introduces a new algorithms for reconstructing the suffix tree of character string, when a substring id… 
2013
2013
GPUBwa-Parallelization of Burrows Wheeler Aligner using Graphical Processing Units
  • 2013
  • Corpus ID: 17289645
A very popular discipline in bioinformatics is Next-Generation Sequencing (NGS) or DNA sequencing. It specifies sequencing… 
2009
2009
An Adaptive Suffix Tree Based Algorithm for Repeats Recognition in a DNA Sequence
Many methods for repeats recognition are based on alignments. Their speed and time significantly limit their applications. This… 
Review
2007
Review
2007
Why an applications and practice magazine? [Message from the Editor-in-Chief]
IEEE Applications & Practice • April 2007 I would like to introduce you to the newest IEEE Communications Society publication… 
Review
2005
Review
2005
Efficient Web Mining for Traversal Path Patterns
A maximal forward reference of a Web user is a longest consecutive sequence of Web pages visited by the user in a session without… 
Highly Cited
2004
Highly Cited
2004
Practical Suffix Tree Construction
2004
2004
Antti Ukkonen Data mining techniques for discovering partial orders
Let the outcome of some arbitrary process be a set S of orders of the elements of a finite set Σ. These orders may encompass all… 
2003
2003
Linear and sublinear time algorithms for mining frequent traversal path patterns from very large Web logs
This paper aims for designing algorithms for the problem of mining frequent traversal path patterns from very large Web logs with… 
1993
1993
O(k) Parallel Algorithms for Approximate String Matching Approximate String Matching (proposed Running Head)
Given a text string T of length n, a shorter pattern string A of length m, and an integer k, an simple straightforward O(k… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)