Regular networks are determined by their trees

Details Regular networks are determined by their trees Regular networks are determined by their trees

2009-02-17

arxiv.org/abs/0902.2970v1

Biology

Quantitative Biology

Populations and Evolution

16 pages

Scientific paper

A rooted acyclic digraph N with labelled leaves displays a tree T when there exists a way to select a unique parent of each hybrid vertex resulting in the tree T. Let Tr(N) denote the set of all trees displayed by the network N. In general, there may be many other networks M such that Tr(M) = Tr(N). A network is regular if it is isomorphic with its cover digraph. This paper shows that if N is regular, there is a procedure to reconstruct N given Tr(N). Hence if N and M are regular networks and Tr(N) = Tr(M), it follows that N = M, proving that a regular network is uniquely determined by its displayed trees.

Affiliated with

Also associated with

No associations

Rating

Regular networks are determined by their trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Regular networks are determined by their trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regular networks are determined by their trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-311646