Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Testing the Agreement of Trees with Internal Labels

    The input to the agreement problem is a collection \(\mathcal {P}= \{\mathcal {T}_1, \mathcal {T}_2, \dots , \mathcal {T}_k\}\) of phylogenetic trees, called input trees, over partially overlap** sets of taxa...

    David Fernández-Baca, Lei Liu in Bioinformatics Research and Applications (2020)

  2. No Access

    Chapter and Conference Paper

    Checking Phylogenetic Decisiveness in Theory and in Practice

    Suppose we have a set X consisting of n taxa and we are given information from k loci from which to construct a phylogeny for X. Each locus offers information for only a fraction of the taxa. The question is whet...

    Ghazaleh Parvini, Katherine Braught in Bioinformatics Research and Applications (2020)

  3. No Access

    Article

    EvoMiner: frequent subtree mining in phylogenetic databases

    The problem of mining collections of trees to identify common patterns, called frequent subtrees (FSTs), arises often when trying to interpret the results of phylogenetic analysis. FST mining generalizes the w...

    Akshay Deepak, David Fernández-Baca in Knowledge and Information Systems (2014)