Results 1  10
of
756,574
Application of Phylogenetic Networks in Evolutionary Studies
 SUBMITTED TO MBE 2005
, 2005
"... The evolutionary history of a set of taxa is usually represented by a phylogenetic tree, and this model has greatly facilitated the discussion and testing of hypotheses. However, it is well known that more complex evolutionary scenarios are poorly described by such models. Further, even when evoluti ..."
Abstract

Cited by 867 (15 self)
 Add to MetaCart
evolution proceeds in a treelike manner, analysis of the data may not be best served by using methods that enforce a tree structure, but rather by a richer visualization of the data to evaluate its properties, at least as an essential first step. Thus, phylogenetic networks should be employed when
Mining Frequent Patterns without Candidate Generation: A FrequentPattern Tree Approach
 DATA MINING AND KNOWLEDGE DISCOVERY
, 2004
"... Mining frequent patterns in transaction databases, timeseries databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriorilike candidate set generationandtest approach. However, candidate set generation is still co ..."
Abstract

Cited by 1700 (64 self)
 Add to MetaCart

based mining method, FPgrowth, for mining the complete set of frequent patterns by pattern fragment growth.
Efficiency of mining is achieved with three techniques: (1) a large database is compressed into a condensed,
smaller data structure, FPtree which avoids costly, repeated database scans, (2) our
Efficient semantic matching
, 2004
"... We think of Match as an operator which takes two graphlike structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract

Cited by 817 (67 self)
 Add to MetaCart
We think of Match as an operator which takes two graphlike structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes
CONTINUOUS TREELIKE SCALES
"... Abstract. Answering a question raised by Luis Pereira, we show that a continuous treelike scale can exist above a supercompact cardinal. We also show that the existence of a continuous treelike scale at ℵω is consistent with Martin’s Maximum. 1. ..."
Abstract
 Add to MetaCart
Abstract. Answering a question raised by Luis Pereira, we show that a continuous treelike scale can exist above a supercompact cardinal. We also show that the existence of a continuous treelike scale at ℵω is consistent with Martin’s Maximum. 1.
TREELIKE CONTINUA
"... A continuum is a compact connected metric space. The main results of this paper (theorems 3.7 and 3.8) are a pair of characterizations of indecomposability for treelike con tinua. l One of the most useful characterizations of inde ..."
Abstract
 Add to MetaCart
A continuum is a compact connected metric space. The main results of this paper (theorems 3.7 and 3.8) are a pair of characterizations of indecomposability for treelike con tinua. l One of the most useful characterizations of inde
Scalable Application Layer Multicast
, 2002
"... We describe a new scalable applicationlayer multicast protocol, specifically designed for lowbandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the applicationlayer multicast peers and can support a number of different data deliv ..."
Abstract

Cited by 719 (21 self)
 Add to MetaCart
delivery trees with desirable properties. We present extensive simulations of both our protocol and the Narada applicationlayer multicast protocol over Internetlike topologies. Our results show that for groups of size 32 or more, our protocol has lower link stress (by about 25%), improved or similar
TreeLike Counterexamples in Model Checking
 In Proceedings of the 17 th Annual IEEE Symposium on Logic in Computer Science (LICS’02
, 2002
"... Counterexamples for specification violations provide engineers with important debugging information. Although counterexamples are considered one of the main advantages of model checking, stateof the art model checkers are restricted to relatively simple counterexamples, and surprisingly little rese ..."
Abstract

Cited by 62 (5 self)
 Add to MetaCart
of temporal logics beyond ACTL admits counterexamples with a simple treelike transition relation. We show that the existence of treelike counterexamples is related to a universal fragment of extended branching time logic based on ! regular temporal operators. (ii) We present new symbolic algorithms
Solving multiclass learning problems via errorcorrecting output codes
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 1995
"... Multiclass learning problems involve nding a de nition for an unknown function f(x) whose range is a discrete set containing k>2values (i.e., k \classes"). The de nition is acquired by studying collections of training examples of the form hx i;f(x i)i. Existing approaches to multiclass l ..."
Abstract

Cited by 730 (8 self)
 Add to MetaCart
Multiclass learning problems involve nding a de nition for an unknown function f(x) whose range is a discrete set containing k>2values (i.e., k \classes"). The de nition is acquired by studying collections of training examples of the form hx i;f(x i)i. Existing approaches to multiclass
Splicing on Treelike Structures
 Proc. of 3rd DIMACS Workshop on DNA based computers
, 1997
"... In this paper, we provide a method to accelerate the power of splicing systems. We introduce the splicing systems on trees to be built as partially annealed single strands, that is a quite similar notion and a natural extension of splicing systems on strings. Trees are a common and useful data struc ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
structure in computer science and have a biological counterpart such as molecular sequences with secondary structures, which are typical structures in RNA sequences. Splicing on trees involves (1) complete subtrees as axioms, (2) restriction operated on the annealed subsequences, (3) rules to substitute a
Contextuality in treelike graphs
"... The contextuality problem connected with existence of joint probability distribution creating all the given marginals is studied. It is shown for several examples considered previously in literature that there exist some new solutions for the joint probability distributions providing the given margi ..."
Abstract
 Add to MetaCart
The contextuality problem connected with existence of joint probability distribution creating all the given marginals is studied. It is shown for several examples considered previously in literature that there exist some new solutions for the joint probability distributions providing the given marginals and numerical example of the new solution is demonstrated. 1
Results 1  10
of
756,574