Suffix Tree of Alignment: An Efficient Index for Similar Data

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F13%3A00209113" target="_blank" >RIV/68407700:21240/13:00209113 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007/978-3-642-45278-9_29" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-642-45278-9_29</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-45278-9_29" target="_blank" >10.1007/978-3-642-45278-9_29</a>

Result language
angličtina
Original language name
Suffix Tree of Alignment: An Efficient Index for Similar Data
Original language description
We consider an index data structure for similar strings. The generalized suffix tree can be a solution for this. The generalized suffix tree of two strings A and B is a compacted trie representing all suffixes in A and B. It has |A|+|B| leaves and can beconstructed in O(|A|+|B|) time. However, if the two strings are similar, the generalized suffix tree is not efficient because it does not exploit the similarity which is usually represented as an alignment of A and B. In this paper we propose a space/time-efficient suffix tree of alignment which wisely exploits the similarity in an alignment. Our suffix tree for an alignment of A and B has |A|+ld +l1 leaves where ld is the sum of the lengths of all parts of B different from A and l1 is the sum of the lengths of some common parts of A and B. We did not compromise the pattern search to reduce the space. Our suffix tree can be searched for a pattern P in O(|P | + occ) time where occ is the number of occurrences of P in A and B. We also pr
Czech name
—
Czech description
—

Project
<a href="/en/project/GA13-03253S" target="_blank" >GA13-03253S: Text and Tree Structures Processing and Their Applications</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 24th Workshop on Combinatorial Algorithms (IWOCA 2013)
ISBN
978-3-642-45277-2
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
337-348
Publisher name
Springer
Place of publication
Berlin
Event location
Rouen
Event date
Jul 10, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)