Results 271 to 280 of about 439,865 (314)

A sequence-based tree similarity search

2015 IEEE 9th International Conference on Research Challenges in Information Science (RCIS), 2015
Tree-structured data are pervasively growing and exploiting them based on similarity is essential for a broad number of applications. Therefore, there has been a growing need to develop high-performance techniques to efficiently look for similar trees across a large number of trees.
Alsayed Algergawy
exaly   +2 more sources

Decision Tree for Sequences

IEEE Transactions on Knowledge and Data Engineering, 2021
Current decision trees such as C4.5 and CART are widely used in different fields due to their simplicity, accuracy and intuitive interpretation. Similar to other popular classifiers, these tree-based classification algorithms are developed for fixed-length vector data and suffer from intrinsic limitations in handling complex data such as sequences.
Zengyou He, Ziyao Wu, Guangyao Xu, Yan Liu 0085, Quan Zou 0001   +4 more
openaire   +1 more source

Optimum Sequence Trees

SIAM Journal on Computing, 1977
The construction problems of optimum sequence trees (or digital search trees) are considered in the following frameworks: 1. construction of optimum trees from a set of keys, 2. transformation of an arbitrary tree into an optimum one, 3. optimum insertions of keys into an optimum tree, 4.
Masahiro Miyakawa, Toshitsugu Yuba, Yoshio Sugito, Mamoru Hoshi   +3 more
openaire   +1 more source

Mining Sequential Trees in a Tree Sequence Database

International Journal of Database Theory and Application, 2014
Tree structures are used extensively in domains such as XML data management, web log analysis, biological computing, and so on. In this paper we introduce the problem of mining frequent sequential trees in a large tree sequence database. We present a framework for mining frequent sequential trees in a so-called tree sequence database.
Yijun Bei, Zhen Lin, Qiyao Wang, Erteng Liu   +3 more
openaire   +1 more source

Minimal Mutation Trees of Sequences

SIAM Journal on Applied Mathematics, 1975
Given a finite tree, some of whose vertices are identified with given finite sequences, we show how to construct sequences for all the remaining vertices simultaneously, so as to minimize the total edge-length of the tree. Edge-length is calculated by a metric whose biological significance is the mutational distance between two sequences.
openaire   +2 more sources

On the Sequencing of Tree Structures for XML Indexing

21st International Conference on Data Engineering (ICDE'05), 2005
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answered holistically through subsequence matching. In this paper, we address the problem of query equivalence with respect to this transformation, and we introduce a performance ...
Haixun Wang, Xiaofeng Meng 0001
openaire   +1 more source

Sequences Characterizing k-Trees

2006
A non-decreasing sequence of n integers is the degree sequence of a 1-tree (i.e., an ordinary tree) on n vertices if and only if there are least two 1’s in the sequence, and the sum of the elements is 2(n–1). We generalize this result in the following ways.
Lotker, Z., Majumdar, D., Narayanaswamy, N., Weber, I.   +3 more
openaire   +2 more sources

Database management with sequence trees and tokens

IEEE Transactions on Knowledge and Data Engineering, 1997
An approach to organizing storage in database systems is presented that, under a wide range of conditions, saves both storage space and processing time. Text values in a database are replaced by short, fixed-length, rank-preserving numeric tokens. The actual values are stored in separate, non-redundant storage.
Robert C. Goldstein, Christian Wagner 0001   +1 more
openaire   +1 more source

On certain trees with the same degree sequence

Discrete Applied Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Radix Tree for Binary Sequences on GPU

2018
In this paper, we present radix tree index structure (R-Trie) able to perform lookup over a set of keys of arbitrary length optimized for GPU processors. We present a fully parallel SIMD organized creation and search strategies. The R-Trie supports configurable bit stride for each level and nodes statistics for optimization purposes.
Krzysztof Kaczmarski, Albert Wolant
openaire   +1 more source