Feb 1, 2010 · In this generalization, each path length between two leaves is replaced by the pair of distances from the leaves to their least common ancestor, ...

Jul 1, 2008 · In this paper we establish some basic results that make it possible the generalization to tree-child time consistent (TCTC) hybridization ...

This paper introduces the extended $\mu$-representation of networks, where the number of paths to reticulations is also taken into account, and allows to ...

The goal of this paper is to go one step beyond in two directions: to generalize to the TCTC hybridization networks setting both the classical nodal distances ...

Bibliographic details on Path lengths in tree-child time consistent hybridization networks.

Path lengths in tree-child time consistent hybridization networks. Gabriel Cardona Mercè Llabrés Francesc Rosselló Gabriel Valiente. Published in: CoRR (2008).

Path lengths in tree-child time consistent hybridization networks, ca. dc.type, Journal Article, en. dc.identifier.doi, 10.1016/j.ins.2009.09.013. -. dc.

Path lengths in tree-child time consistent hybridization networks. In Information Sciences, Vol. 180(3):366-383, 2010. Keywords: distance between networks ...

Path lengths in tree-child time consistent hybridization networks. In Information Sciences, Vol. 180(3):366-383, 2010. Keywords: distance between networks ...

Download scientific diagram | These phylogenetic trees have the same path lengths between pairs of leaves, but they are not isomorphic. from publication: ...