A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Regular Networks Can be Uniquely Constructed from Their Trees

2011
*
IEEE/ACM Transactions on Computational Biology & Bioinformatics
*

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 T r(N ) denote the set of all trees displayed by the network N . In general, there may be many other networks M such that T r(M ) = T r(N ). A network is regular if it is isomorphic with its cover digraph. If N is regular and D is a collection of trees displayed by N , this paper studies some procedures to try to reconstruct N

doi:10.1109/tcbb.2010.69
pmid:20714025
fatcat:3hozjhw2ena4lgmionsmktiutm