Re: Suffix trees versus prefix arrays
- From: "4N" <xxx@xxxxxxx>
- Date: Fri, 4 Jul 2008 12:51:06 +0200
<almurph@xxxxxxxxxxxxx> ha scritto nel messaggio
news:12d19b6a-331b-40f2-abad-bbff88309238@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Hi everyone
Why do suffix trees/arrays _appear_ to be more commonly used then
prefix trees/arrays? Is it due to some property of language (like
script is read from the left to the right)? Or does it make no
difference at all? Is there some sort of advantage?
I would appreciate any comments that you may have on this.
Thanks,
Al.
From Wikipedia:A trie, or prefix tree, is an ordered tree data structure that is used to
store an associative array where the keys are usually strings.
A suffix tree (also called suffix trie, PAT tree or, in an earlier form,
position tree) is a data structure that presents the suffixes of a given
string in a way that allows for a particularly fast implementation of many
important string operations, for instance locating a substring in S,
locating a substring if a certain number of mistakes are allowed, locating
matches for a regular expression pattern etc. Suffix trees also provided one
of the first linear-time solutions for the longest common substring problem.
These speedups come at a cost: storing a string's suffix tree typically
requires significantly more space than storing the string itself.
.
- Prev by Date: Re: searching for missing element in an array
- Next by Date: Re: searching for missing element in an array
- Previous by thread: Next Generation Test Management System
- Next by thread: Re: Suffix trees versus prefix arrays
- Index(es):
Relevant Pages
|