Results 251 to 260 of about 2,969,729 (299)
The afterlife of a horizontally transferred gene: Expansion and functional diversification of a C1A peptidase in wild Hordeum species. [PDF]
Plant GenomeMahelka V +9 more
europepmc +1 more source
Genomic Footprints of Historical Introgression Between Ancient Lineages of Wild Oryza AA-Genome Species With Widely Separated Contemporary Distributions. [PDF]
Genome Biol EvolKoyanagi KO, Kotoku Y, Kishima Y.
europepmc +1 more source
The Scaling Limit of Random Two-Connected Series-Parallel Maps. [PDF]
J Theor ProbabAmankwah D +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +4 more
openaire +2 more sources
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 +4 more
openaire +2 more sources
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 +3 more
openaire +1 more source
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 +3 more
openaire +1 more source
Mining Sequential Trees in a Tree Sequence Database
International Journal of Database Theory and Application, 2014Tree 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 +3 more
openaire +1 more source
Sequences Characterizing k-Trees
2006A 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. +3 more
openaire +2 more sources
Tree Sequence Kernel for Natural Language
Proceedings of the AAAI Conference on Artificial Intelligence, 2011We propose Tree Sequence Kernel (TSK), which implicitly exhausts the structure features of a sequence of subtrees embedded in the phrasal parse tree. By incorporating the capability of sequence kernel, TSK enriches tree kernel with tree sequence features so that it may provide additional useful patterns for machine learning applications.
Jun Sun 0024 +2 more
openaire +2 more sources
Minimal Mutation Trees of Sequences
SIAM Journal on Applied Mathematics, 1975Given 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