forester/java/src/org/forester/sdi/GSDIR.java

   1 // $Id:\r
   2 // FORESTER -- software libraries and applications\r
   3 // for evolutionary biology research and applications.\r
   4 //\r
   5 // Copyright (C) 2008-2013 Christian M. Zmasek\r
   6 // All rights reserved\r
   7 //\r
   8 // This library is free software; you can redistribute it and/or\r
   9 // modify it under the terms of the GNU Lesser General Public\r
  10 // License as published by the Free Software Foundation; either\r
  11 // version 2.1 of the License, or (at your option) any later version.\r
  12 //\r
  13 // This library is distributed in the hope that it will be useful,\r
  14 // but WITHOUT ANY WARRANTY; without even the implied warranty of\r
  15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r
  16 // Lesser General Public License for more details.\r
  17 //\r
  18 // You should have received a copy of the GNU Lesser General Public\r
  19 // License along with this library; if not, write to the Free Software\r
  20 // Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA\r
  21 //\r
  22 // Contact: phylosoft @ gmail . com\r
  23 // WWW: www.phylosoft.org\r
  24 \r
  25 package org.forester.sdi;\r
  26 \r
  27 import java.util.ArrayList;\r
  28 import java.util.List;\r
  29 import java.util.Set;\r
  30 import java.util.SortedSet;\r
  31 \r
  32 import org.forester.phylogeny.Phylogeny;\r
  33 import org.forester.phylogeny.PhylogenyBranch;\r
  34 import org.forester.phylogeny.PhylogenyMethods;\r
  35 import org.forester.phylogeny.PhylogenyNode;\r
  36 import org.forester.phylogeny.iterators.PhylogenyNodeIterator;\r
  37 import org.forester.sdi.SDIutil.TaxonomyComparisonBase;\r
  38 import org.forester.util.BasicDescriptiveStatistics;\r
  39 \r
  40 public class GSDIR implements GSDII {\r
  41 \r
  42     private final int                        _min_duplications_sum;\r
  43     private final int                        _speciations_sum;\r
  44     private final BasicDescriptiveStatistics _duplications_sum_stats;\r
  45     private final List<Phylogeny>            _min_duplications_sum_gene_trees;\r
  46     private final List<PhylogenyNode>        _stripped_gene_tree_nodes;\r
  47     private final List<PhylogenyNode>        _stripped_species_tree_nodes;\r
  48     private final Set<PhylogenyNode>         _mapped_species_tree_nodes;\r
  49     private final TaxonomyComparisonBase     _tax_comp_base;\r
  50     private final SortedSet<String>          _scientific_names_mapped_to_reduced_specificity;\r
  51 \r
  52     public GSDIR( final Phylogeny gene_tree,\r
  53                   final Phylogeny species_tree,\r
  54                   final boolean strip_gene_tree,\r
  55                   final boolean strip_species_tree ) throws SDIException {\r
  56         final NodesLinkingResult nodes_linking_result = GSDI.linkNodesOfG( gene_tree,\r
  57                                                                            species_tree,\r
  58                                                                            strip_gene_tree,\r
  59                                                                            strip_species_tree );\r
  60         _stripped_gene_tree_nodes = nodes_linking_result.getStrippedGeneTreeNodes();\r
  61         _stripped_species_tree_nodes = nodes_linking_result.getStrippedSpeciesTreeNodes();\r
  62         _mapped_species_tree_nodes = nodes_linking_result.getMappedSpeciesTreeNodes();\r
  63         _scientific_names_mapped_to_reduced_specificity = nodes_linking_result\r
  64                 .getScientificNamesMappedToReducedSpecificity();\r
  65         _tax_comp_base = nodes_linking_result.getTaxCompBase();\r
  66         final List<PhylogenyBranch> gene_tree_branches_post_order = new ArrayList<PhylogenyBranch>();\r
  67         for( final PhylogenyNodeIterator it = gene_tree.iteratorPostorder(); it.hasNext(); ) {\r
  68             final PhylogenyNode n = it.next();\r
  69             if ( !n.isRoot() /*&& !( n.getParent().isRoot() && n.isFirstChildNode() )*/) {\r
  70                 gene_tree_branches_post_order.add( new PhylogenyBranch( n, n.getParent() ) );\r
  71             }\r
  72         }\r
  73         int min_duplications_sum = Integer.MAX_VALUE;\r
  74         int speciations_sum = 0;\r
  75         _min_duplications_sum_gene_trees = new ArrayList<Phylogeny>();\r
  76         _duplications_sum_stats = new BasicDescriptiveStatistics();\r
  77         for( final PhylogenyBranch branch : gene_tree_branches_post_order ) {\r
  78             gene_tree.reRoot( branch );\r
  79             PhylogenyMethods.preOrderReId( species_tree );\r
  80             //TEST, remove later\r
  81             //            for( final PhylogenyNodeIterator it = _gene_tree.iteratorPostorder(); it.hasNext(); ) {\r
  82             //                final PhylogenyNode g = it.next();\r
  83             //                if ( g.isInternal() ) {\r
  84             //                    g.setLink( null );\r
  85             //                }\r
  86             //            }\r
  87             final GSDIsummaryResult gsdi_result = GSDI.geneTreePostOrderTraversal( gene_tree, true );\r
  88             if ( gsdi_result.getDuplicationsSum() < min_duplications_sum ) {\r
  89                 min_duplications_sum = gsdi_result.getDuplicationsSum();\r
  90                 speciations_sum = gsdi_result.getSpeciationsSum();\r
  91                 _min_duplications_sum_gene_trees.clear();\r
  92                 _min_duplications_sum_gene_trees.add( gene_tree.copy() );\r
  93                 //_speciations_sum\r
  94             }\r
  95             else if ( gsdi_result.getDuplicationsSum() == min_duplications_sum ) {\r
  96                 _min_duplications_sum_gene_trees.add( gene_tree.copy() );\r
  97             }\r
  98             _duplications_sum_stats.addValue( gsdi_result.getDuplicationsSum() );\r
  99         }\r
 100         _min_duplications_sum = min_duplications_sum;\r
 101         _speciations_sum = speciations_sum;\r
 102     }\r
 103 \r
 104     public BasicDescriptiveStatistics getDuplicationsSumStats() {\r
 105         return _duplications_sum_stats;\r
 106     }\r
 107 \r
 108     @Override\r
 109     public Set<PhylogenyNode> getMappedExternalSpeciesTreeNodes() {\r
 110         return _mapped_species_tree_nodes;\r
 111     }\r
 112 \r
 113     public int getMinDuplicationsSum() {\r
 114         return _min_duplications_sum;\r
 115     }\r
 116 \r
 117     public List<Phylogeny> getMinDuplicationsSumGeneTrees() {\r
 118         return _min_duplications_sum_gene_trees;\r
 119     }\r
 120 \r
 121     @Override\r
 122     public final SortedSet<String> getReMappedScientificNamesFromGeneTree() {\r
 123         return _scientific_names_mapped_to_reduced_specificity;\r
 124     }\r
 125 \r
 126     @Override\r
 127     public int getSpeciationsSum() {\r
 128         return _speciations_sum;\r
 129     }\r
 130 \r
 131     @Override\r
 132     public List<PhylogenyNode> getStrippedExternalGeneTreeNodes() {\r
 133         return _stripped_gene_tree_nodes;\r
 134     }\r
 135 \r
 136     @Override\r
 137     public List<PhylogenyNode> getStrippedSpeciesTreeNodes() {\r
 138         return _stripped_species_tree_nodes;\r
 139     }\r
 140 \r
 141     @Override\r
 142     public TaxonomyComparisonBase getTaxCompBase() {\r
 143         return _tax_comp_base;\r
 144     }\r
 145 \r
 146     public final static List<Integer> getIndexesOfShortestTree( final List<Phylogeny> assigned_trees ) {\r
 147         final List<Integer> shortests = new ArrayList<Integer>();\r
 148         boolean depth = true;\r
 149         double x = Double.MAX_VALUE;\r
 150         for( int i = 0; i < assigned_trees.size(); ++i ) {\r
 151             final Phylogeny phy = assigned_trees.get( i );\r
 152             if ( i == 0 ) {\r
 153                 if ( PhylogenyMethods.calculateMaxDistanceToRoot( phy ) > 0 ) {\r
 154                     depth = false;\r
 155                 }\r
 156             }\r
 157             final double d;\r
 158             if ( depth ) {\r
 159                 d = PhylogenyMethods.calculateMaxDepth( phy );\r
 160             }\r
 161             else {\r
 162                 d = PhylogenyMethods.calculateMaxDistanceToRoot( phy );\r
 163             }\r
 164             if ( d < x ) {\r
 165                 x = d;\r
 166                 shortests.clear();\r
 167                 shortests.add( i );\r
 168             }\r
 169             else if ( d == x ) {\r
 170                 shortests.add( i );\r
 171             }\r
 172         }\r
 173         return shortests;\r
 174     }\r
 175 }\r