NAME
Bio::Tree::Node - A Simple Tree Node
SYNOPSIS
use Bio::Tree::Node;my $nodeA = Bio::Tree::Node->new();my $nodeL = Bio::Tree::Node->new();my $nodeR = Bio::Tree::Node->new();my $node = Bio::Tree::Node->new();$node->add_Descendent($nodeL);$node->add_Descendent($nodeR);print "node is not a leaf \n" if( $node->is_leaf);
DESCRIPTION
Makes a Tree Node suitable for building a Tree.
FEEDBACK
Mailing Lists
User feedback is an integral part of the evolution of this and other Bioperl modules. Send your comments and suggestions preferably to the Bioperl mailing list. Your participation is much appreciated.
[email protected] - General discussionhttp://bioperl.org/wiki/Mailing_lists - About the mailing lists
Support
Please direct usage questions or support issues to the mailing list:
rather than to the module maintainer directly. Many experienced and reponsive experts will be able look at the problem and quickly address it. Please include a thorough description of the problem with code and data examples if at all possible.
Reporting Bugs
Report bugs to the Bioperl bug tracking system to help us keep track of the bugs and their resolution. Bug reports can be submitted via the web:
https://github.com/bioperl/bioperl-live/issues
AUTHOR - Jason Stajich
Email jason-at-bioperl-dot-org
CONTRIBUTORS
Aaron Mackey, amackey-at-virginia-dot-edu Sendu Bala, [email protected]
APPENDIX
The rest of the documentation details each of the object methods. Internal methods are usually preceded with a _
new
Title : newUsage : my $obj = Bio::Tree::Node->new();Function: Builds a new Bio::Tree::Node objectReturns : Bio::Tree::NodeArgs : -descendents => arrayref of descendents (they will beupdated s.t. their ancestor point is thisnode)-branch_length => branch length [integer] (optional)-bootstrap => value bootstrap value (string)-description => description of node-id => human readable id for node
create_node_on_branch
Title : create_node_on_branchUsage : $node->create_node_on_branch($at_length)Function: Create a node on the ancestral branch of the callingobject.Example :Returns : the created nodeArgs : -POSITION=>$absolute_branch_length_from_caller (default)-FRACTION=>$fraction_of_branch_length_from_caller-ANNOT=>{ -id => "the id", -desc => "the description" }-FORCE, set to allow nodes with zero branch lengths
add_Descendent
Title : add_DescendentUsage : $node->add_Descendent($node);Function: Adds a descendent to a nodeReturns : number of current descendents for this nodeArgs : Bio::Node::NodeIboolean flag, true if you want to ignore the fact that you areadding a second node with the same unique id (typically memorylocation reference in this implementation). default is false andwill throw an error if you try and overwrite an existing node.
each_Descendent
Title : each_Descendent($sortby)Usage : my @nodes = $node->each_Descendent;Function: all the descendents for this Node (but not their descendentsi.e. not a recursive fetchall)Returns : Array of Bio::Tree::NodeI objectsArgs : $sortby [optional] "height", "creation", "alpha", "revalpha",or coderef to be used to sort the order of children nodes.
remove_Descendent
Title : remove_DescendentUsage : $node->remove_Descendent($node_foo);Function: Removes a specific node from being a Descendent of this nodeReturns : nothingArgs : An array of Bio::Node::NodeI objects which have been previouslypassed to the add_Descendent call of this object.
remove_all_Descendents
Title : remove_all_DescendentsUsage : $node->remove_All_Descendents()Function: Cleanup the node's reference to descendents and resettheir ancestor pointers to undef, if you don't have a referenceto these objects after this call they will be cleaned up - soa get_nodes from the Tree object would be a safe thing to do firstReturns : nothingArgs : none
get_all_Descendents
Title : get_all_DescendentsUsage : my @nodes = $node->get_all_Descendents;Function: Recursively fetch all the nodes and their descendents*NOTE* This is different from each_DescendentReturns : Array or Bio::Tree::NodeI objectsArgs : none
ancestor
Title : ancestorUsage : $obj->ancestor($newval)Function: Set the AncestorReturns : ancestral nodeArgs : newvalue (optional)
branch_length
Title : branch_lengthUsage : $obj->branch_length()Function: Get/Set the branch lengthReturns : value of branch_lengthArgs : newvalue (optional)
bootstrap
Title : bootstrapUsage : $obj->bootstrap($newval)Function: Get/Set the bootstrap valueReturns : value of bootstrapArgs : newvalue (optional)
description
Title : descriptionUsage : $obj->description($newval)Function: Get/Set the description stringReturns : value of descriptionArgs : newvalue (optional)
id
Title : idUsage : $obj->id($newval)Function: The human readable identifier for the nodeReturns : value of human readable idArgs : newvalue (optional)
"A name can be any string of printable characters except blanks, colons, semicolons, parentheses, and square brackets. Because you may want to include a blank in a name, it is assumed that an underscore character ("_") stands for a blank; any of these in a name will be converted to a blank when it is read in."
from <http://evolution.genetics.washington.edu/phylip/newicktree.html>
Also note that these objects now support spaces, ();: because we can automatically quote the strings if they contain these characters. The id_output method does this for you so use the id() method to get the raw string while id_output to get the pre-escaped string.
Helper Functions
id_output
Title : id_outputUsage : my $id = $node->id_output;Function: Return an id suitable for output in format like newickso that if it contains spaces or ():; characters it is properlyquotedReturns : $id string if $node->id has a valueArgs : none
internal_id
Title : internal_idUsage : my $internalid = $node->internal_idFunction: Returns the internal unique id for this Node(a monotonically increasing number for this in-memory implementationbut could be a database determined unique id in otherimplementations)Returns : unique idArgs : none
_creation_id
Title : _creation_idUsage : $obj->_creation_id($newval)Function: a private method signifying the internal creation orderReturns : value of _creation_idArgs : newvalue (optional)
Bio::Node::NodeI decorated interface implemented
The following methods are implemented by Bio::Node::NodeI decorated interface.
is_Leaf
Title : is_LeafUsage : if( $node->is_Leaf )Function: Get Leaf statusReturns : booleanArgs : none
height
Title : heightUsage : my $len = $node->heightFunction: Returns the height of the tree starting at thisnode. Height is the maximum branchlength to get to the tip.Returns : The longest length (weighting branches with branch_length) to a leafArgs : none
invalidate_height
Title : invalidate_heightUsage : private helper methodFunction: Invalidate our cached value of the node height in the treeReturns : nothingArgs : none
set_tag_value
Title : set_tag_valueUsage : $node->set_tag_value($tag,$value)$node->set_tag_value($tag,@values)Function: Sets a tag value(s) to a node. Replaces old values.Returns : number of values stored for this tagArgs : $tag - tag name$value - value to store for the tag
add_tag_value
Title : add_tag_valueUsage : $node->add_tag_value($tag,$value)Function: Adds a tag value to a nodeReturns : number of values stored for this tagArgs : $tag - tag name$value - value to store for the tag
remove_tag
Title : remove_tagUsage : $node->remove_tag($tag)Function: Remove the tag and all values for this tagReturns : boolean representing success (0 if tag does not exist)Args : $tag - tagname to remove
remove_all_tags
Title : remove_all_tagsUsage : $node->remove_all_tags()Function: Removes all tagsReturns : NoneArgs : None
get_all_tags
Title : get_all_tagsUsage : my @tags = $node->get_all_tags()Function: Gets all the tag names for this NodeReturns : Array of tagnamesArgs : None
get_tag_values
Title : get_tag_valuesUsage : my @values = $node->get_tag_values($tag)Function: Gets the values for given tag ($tag)Returns : In array context returns an array of valuesor an empty list if tag does not exist.In scalar context returns the first value or undef.Args : $tag - tag name
has_tag
Title : has_tagUsage : $node->has_tag($tag)Function: Boolean test if tag exists in the NodeReturns : BooleanArgs : $tag - tagname
reverse_edge
Title : reverse_edgeUsage : $node->reverse_edge(child);Function: makes child be a parent of nodeRequires: child must be a direct descendent of nodeReturns : 1 on success, 0 on failureArgs : Bio::Tree::NodeI that is in the tree