Generalized suffix tree

Known as: GST, Generalised suffix tree

In computer science, a generalized suffix tree is a suffix tree for a set of strings. Given the set of strings of total length , it is a Patricia…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

Suffix trees have emerged to be very fast for pattern searching yielding O (m) time, where m is the pattern size. Unfortunately…

2017

The generalized suffix tree (GST) is a tree structure that is widely used by string-based applications such as DNA sequence…

2015

In the life sciences, determining the sequence of bio-molecules is essential step towards the understanding of their functions…

2012

Discovering patterns from sequence data has significant impact in many aspects of science and society, especially in genomics and…

2012

Most of the existing Chinese webpage duplicate elimination approaches do not focus on noisy and fuzzy duplicates elimination. In…

2009

The original suffix tree clustering(STC) algorithm can not effectively process the nodes with text documents that differ greatly…

2007

There has been a growing interest in discovery of significant patterns in biological sequences that correspond to some structural…

2005

This report explores the problem of substring search in a dynamic document set. The operations supported are document inclusion…

2003

Multigram language model has become important in Speech Recognition, Natural Language Processing and Information Retrieval. An…

2003

We present a data structure based on suffix trees that provides fast methods for searching three-dimensional polypeptide…