Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Gastaldello, Mattia"'
A graph G=(V,E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers `d' and `D' such that each leaf `u' of T is a node of V and the edge `(u,v) belongs to E' iff `d <= d_T(u, v) <= D' wher
Externí odkaz:
http://arxiv.org/abs/1504.06454
Autor:
Calamoneri, Tiziana1 (AUTHOR), Gastaldello, Mattia1,2,3 (AUTHOR), Mary, Arnaud2,3 (AUTHOR), Sagot, Marie-France2,3 (AUTHOR), Sinaimeri, Blerina2,3 (AUTHOR) blerina.sinaimeri@inria.fr
Publikováno v:
Algorithms for Molecular Biology. 7/22/2020, Vol. 15 Issue 1, p1-16. 16p.
Autor:
Calamoneri, Tiziana, Gastaldello, Mattia, Mary, Arnaud, Sagot, Marie-France, Sinaimeri, Blerina
Publikováno v:
Combinatorial Algorithms: 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings; 2016, p137-150, 14p