Results 91 to 100 of about 6,253 (207)
Engineering a Fast Online Persistent Suffix Tree Construction [PDF]
, 2004 Online persistent suffix tree construction has been considered impractical due to its excessive I/O costs. However, these prior studies have not taken into account the effects of the buffer management policy and the internal node structure of the suffix ...
Bedathur, Srikanta J, Haritsa, Jayant R
core +2 more sources
Space-Efficient Construction Algorithm for the Circular Suffix Tree [PDF]
, 2013 Hon et al. (2011) proposed a variant of the suffix tree, called circular suffix tree, and showed that it can be stored succinctly and can be used to solve the circular dictionary matching problem efficiently. In this paper, we give the first construction
Sharma V. Thankachan +7 more
core +1 more source
Suffix Tree Construction Algorithms [PDF]
, 2007 In the present work we study suffix tree construction algorithms. This structure helps solving a variety of text problems in optimal time. There are several approaches and algorithms for building a suffix tree.
Host, Ján
core +2 more sources
Accelerated preprocessing in task of searching substrings in a string
Advanced Engineering Research, 2019 Introduction. A rapid development of the systems such as Yandex, Google, etc., has predetermined the relevance of the task of searching substrings in a string, and approaches to its solution are actively investigated. This task is used to create database
A. V. Mazurenko, N. V. Boldyrikhin
doaj +1 more source
Topics in Cognitive Science, EarlyView.Abstract The space of human goals is tremendously vast; and yet, from just a few moments of watching a scene or reading a story, we seem to spontaneously infer a range of plausible motivations for the people and characters involved. What explains this remarkable capacity for intuiting other agents' goals, despite the infinitude of ends they might ...
Tan Zhi‐Xuan +3 more
wiley +1 more source
A hard-disk based suffix tree implementation [PDF]
, 2011 Suffix trees are incredibly useful structures for computational genomics and combinatorial pattern matching. Due to the small alphabet sizes used in computational genomics, specialised hard-disk based suffix trees have been designed, but the problem of ...
Nicart, F, Snowsill, TM
core
Sedimentology, Volume 73, Issue 5, Page 1750-1798, August 2026.ABSTRACT Features considered indicative of hyperpycnites and intrabasinal turbidites overlap. Outcrop study presented here suggests that the Westward Ho! Formation forms an 800 m high deepwater‐slope system dominated by hyperpycnites. Taking this unit, and other successions where hyperpycnites have been described, as having been deposited solely from ...
Tony Reynolds
wiley +1 more source
RD-GST: online method for constructing distributed generalized suffix trees
Технічна інженеріяGeneralized suffix trees (GST) are fundamental data structures for exact substring search with linear time complexity with respect to query length , regardless of the size of the indexed corpus.
I.S. Sadovyi, V.V. Vorotnikov
doaj +1 more source
Fast index based algorithms and software for matching position specific scoring matrices [PDF]
, 2006 Beckstette M, Homann R, Giegerich R, Kurtz S. Fast index based algorithms and software for matching position specific scoring matrices. BMC Bioinformatics.
Kurtz Stefan +11 more
core +2 more sources
Research of Stock Time Series Based on probabilistic Suffix Tree
四川大学学报. 自然科学版, 2018 this paper introduces a Probabilistic Suffix Tree (PST) method based on the time series symbolization, and constructs a stock forecasting model based on the combination of time series symbolizationa and PST.
CHENG Xiao-Lin, ZHENG Xing, LI Xu-Wei
doaj