Algorithmic Aspects of Tree Amalgamation

نویسندگان

  • Sebastian Böcker
  • David Bryant
  • Andreas W. M. Dress
  • Mike A. Steel
چکیده

The amalgamation of leaf-labelled trees into a single (super)tree that “displays” each of the input trees is an important problem in classification. We discuss various approaches to this problem and show that a simple and well known polynomial-time algorithm can be used to solve this problem whenever the input set of trees contains a minimum size subset that uniquely determines the supertree. Our results exploit a recently established combinatorial property concerning the structure of such collections of trees. 1991 Mathematics Subject Classification. 05C05, 92D15

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Experimental Evaluation of Algorithmic Effort Estimation Models using Projects Clustering

One of the most important aspects of software project management is the estimation of cost and time required for running information system. Therefore, software managers try to carry estimation based on behavior, properties, and project restrictions. Software cost estimation refers to the process of development requirement prediction of software system. Various kinds of effort estimation patter...

متن کامل

On pm$^+$ and finite character bi-amalgamation

‎Let $f:Arightarrow B$ and $g:A rightarrow C$ be two ring homomorphisms and let $J$ and $J^{'}$ be two ideals of $B$ and $C$‎, ‎respectively‎, ‎such that $f^{-1}(J)=g^{-1}(J^{'})$‎. ‎The bi-amalgamation of $A$ with $(B,C)$ along $(J,J^{'})$ with respect of $(f,g)$ is the subring of $Btimes C$ given by‎ ‎$Abowtie^{f,g}(J,J^{'})={(f(a)+j,g(a)+j^{'})‎/ ‎a in A‎, ‎(j,j^{'}) in Jtimes J^{'}}.$‎ ‎In ...

متن کامل

Exponentially many supertrees

The amalgamation of leaf-labelled trees into a single supertree that displays each of the input trees is an important problem in classification. Clearly, there can be more than one (super) tree for a given set of input trees, in particular if a highly unresolved supertree exists. Here, we show (by explicit construction) that even if every supertree of a given collection of input trees is binary...

متن کامل

An Improved Algorithmic Method for Software Development Effort Estimation

Accurate estimating is one of the most important activities in the field of software project management. Different aspects of software projects must be estimated among which time and effort are of significant importance to efficient project planning. Due to complexity of software projects and lack of information at the early stages of project, reliable effort estimation is a challenging issue. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Algorithms

دوره 37  شماره 

صفحات  -

تاریخ انتشار 2000