Results 241 to 250 of about 1,226,857 (290)
Genomic insights into the global dissemination of linezolid resistance genes in <i>Enterococcus faecium</i>. [PDF]
Front MicrobiolYuan X +6 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 +1 more source
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 +1 more source
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.
Miyakawa, Masahiro +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.
Miyakawa, Masahiro +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
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
Phylogenetic Trees From Sequences
2010In this chapter, we review important concepts and approaches for phylogeny reconstruction from sequence data.We first cover some basic definitions and properties of phylogenetics, and briefly explain how scientists model sequence evolution and measure sequence divergence.
Paul Ryvkin, Li-San Wang
openaire +1 more source