Four experiments studied the interfering effects of a to-be-ignored "stimulus suffix" on cued recall of feature bindings for a series of objects. When each object was given equal weight (Experiment 1) or rewards favored recent items (Experiments 2 and 4), a recency effect emerged that was selectively reduced by a suffix. The reduction was greater for a "plausible" suffix with features drawn fro...

Designing external memory data structures for string databases is of significant recent interest due to the proliferation of biological sequence data. The suffix tree is an important indexing structure that provides optimal algorithms for memory bound data. However, string Btrees provide the best known asymptotic performance in external memory for substring search and update operations. Work on...

Because of the large datasets that are usually involved in deoxyribonucleic acid (DNA) sequence alignment, the use of optimal local alignment algorithms (e.g., Smith–Waterman) is often unfeasible in practical applications. As such, more efficient solutions that rely on indexed search procedures are often preferred to significantly reduce the time to obtain such alignments. Some data structures ...

In Korean verbal inflection, all forms in the paradigm (A-suffix, C-suffix, or ɨ-suffix forms) suffer from neutralization of some lexical contrasts, and there is no single form of the paradigm from which one can correctly predict all the other forms in the paradigm. Nevertheless, a survey of child errors and historical change show that the attested reanalyses are overwhelmingly based on ambigui...

This paper argues that the distribution of -(a)licious and -(a)thon is a result of speakers applying ∗ and ∗ , well-motived constraints in English, to novel suffixes. Both experimental and corpus data show that the form of the suffix, e.g. -alicious with schwa or -licious without, tends to avoid stress clash and hiatus. The claim that speakers use their existing English phonological grammar for...

Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate index data structures for such 3-D structures are highly desired for research on proteins. The geometric suffix tree is a very sophisticated index structure that enables fast and accurate search on protein 3-D structures. By using it, we can search from 3-D structure dat...

The suffix array is a data structure that finds numerous applications in string processing problems for both linguistic texts and biological data. It has been introduced as a memory efficient alternative for suffix trees. The suffix array consists of the sorted suffixes of a string. There are several linear time suffix array construction algorithms (SACAs) known in the literature. However, one ...

The suffix tree — the compacted trie of all suffixes a string is most important and widely-used data structure in processing. We consider natural combinatorial question about trees: for S length n, how many nodes νS(d) can there be at (string) depth d its tree? prove ν(n,d)=maxS∈Σn⁡νS(d) O((n/d)log⁡(n/d)), show that this bound asymptotically tight, describing strings which Ω((n/d)log⁡(n/d)).