N
Nick Mirro
An evolutionary tree is represented by names in several tables using
NodeNames, NodeIDs and ParentIDs. The link below shows the relationships.
Imagine the tree is upright in this description (parents are down). Each
node in the tree (except the few at the very bottom - trunk portion) has
assigned to it a parent node by the identifier, ParentID. This creates a
sequential hierarchy below each childmost terminal (leaf) node in the tree.
I have 114 genus names and their NodeIDs. I would like to return a list of
all sequential parents (NodeIds and NodeNames) to the very bottom of the
tree for each of the 114 (leafy) genuses. Each should have somewhere
between 15 and 40 ancestors. If someone wouldn't mind helping me, how could
I query or code for these 114 ancestral lists? Thanks.
Nick
http://home.comcast.net/~nickmirro/images/Temporary/Relationships.JPG
NodeNames, NodeIDs and ParentIDs. The link below shows the relationships.
Imagine the tree is upright in this description (parents are down). Each
node in the tree (except the few at the very bottom - trunk portion) has
assigned to it a parent node by the identifier, ParentID. This creates a
sequential hierarchy below each childmost terminal (leaf) node in the tree.
I have 114 genus names and their NodeIDs. I would like to return a list of
all sequential parents (NodeIds and NodeNames) to the very bottom of the
tree for each of the 114 (leafy) genuses. Each should have somewhere
between 15 and 40 ancestors. If someone wouldn't mind helping me, how could
I query or code for these 114 ancestral lists? Thanks.
Nick
http://home.comcast.net/~nickmirro/images/Temporary/Relationships.JPG