Titlebook: Combinatorial Pattern Matching; 17th Annual Symposiu Moshe Lewenstein,Gabriel Valiente Conference proceedings 2006 Springer-Verlag Berlin H

Acquired

On-Line Linear-Time Construction of Word Suffix TreesSparse suffix trees are kind of suffix trees that represent only a subset of suffixes of the input string. In this paper we study ., which are one variation of sparse suffix trees. Let . be a dictionary of words and . be a string in .., namely, . is a sequence .. ?.. of . words in .. The word suffix

Longitude

Obtaining Provably Good Performance from Suffix Trees in Secondary Storage. The suffix tree is an important indexing structure that provides optimal algorithms for memory bound data. However, string B-trees provide the best known asymptotic performance in external memory for substring search and update operations. Work on external memory variants of suffix trees has large

不溶解

Geometric Suffix Tree: A New Index Structure for Protein 3-D Structuresr such 3-D structures are highly desired for research on proteins. This paper proposes a new data structure for indexing protein 3-D structures. For strings, there are many efficient indexing structures such as suffix trees, but it has been considered very difficult to design such sophisticated data

沒有希望

皮薩