نتایج جستجو برای: median subtree
تعداد نتایج: 149739 فیلتر نتایج به سال:
Hurwitz's extension of Abel's binomial theorem de nes a probability distribution on the set of integers from 0 to n. This is the distribution of the number of non-root vertices of a fringe subtree of a suitably de ned random tree with n + 2 vertices. The asymptotic behaviour of this distribution is described in a limiting regime where the distribution of the delabeled fringe subtree approaches ...
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph class generalizes both the class of chordal graphs and the class of t-interval graphs, a generalization of interval graphs that has recently been studied from a combinatorial optimization point of view. We present approx...
The relationship between two important problems in tree pattern matching, the largest common subtree and the smallest common supertree problems, is established by means of simple constructions, which allow one to obtain a largest common subtree of two trees from a smallest common supertree of them, and vice versa. These constructions are the same for isomorphic, homeomorphic, topological, and m...
1. Is there a constant ratio approximation algorithm for the nni distance on unweighted evolutionary trees or is the O(log n)-approximation the best possible? 2. Is the linear-cost subtree-transfer distance NP-hard to compute on weighted evolutionary trees if leaf labels are not allowed to be non-unique? 3. Can one improve the approximation ratio for linearcost subtree-transfer distance on weig...
Many natural language processing (NLP) applications require the computation of similarities between pairs of syntactic or semantic trees. Many researchers have used tree edit distance for this task, but this technique suffers from the drawback that it deals with single node operations only. We have extended the standard tree edit distance algorithm to deal with subtree transformation operations...
A chain packing H in a graph is a subgraph satisfying given degree constraints at the vertices. Its size is the number of odd degree vertices in the subgraph. An odd subtree packing is a chain packing which is a forest in which all non-isolated vertices have odd degree in the forest. We show that for a given graph and degree constraints, the size of a maximum chain packing and a maximum odd sub...
Gavril [GA4] defined two new families of intersection graphs: the interval-filament graphs and the subtree-filament graphs. The complements of intervalfilament graphs are the cointerval mixed graphs and the complements of subtree-filament graphs are the cochordal mixed graphs. The family of interval-filament graphs contains the families of cocomparability, polygon-circle, circle and chordal gra...
An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of species. An agreement subtree of two evolutionary trees is an evolutionary tree which is also a topological subtree of the two given trees. We give an algorit...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید