• 1
  • 2
  • 5
  • 6
  • 7
  • 8
  • 9
  • 3
  • 4
IPM
30
YEARS OLD

“School of Biological”

Back to Papers Home
Back to Papers of School of Biological

Paper   IPM / Biological / 13628
School of Biological Sciences
  Title:   TripNet: A Method for Constructing Rooted Phylogenetic Networks from Triplets
  Author(s): 
1 . H. Poormohammadi.
2 . C. Eslahchi.
3 . R. Tusserkani.
  Status:   Published
  Journal: Plos One
  No.:  9
  Vol.:  9
  Year:  2014
  Pages:   1-12
  Supported by:  IPM
  Abstract:
The problem of constructing an optimal rooted phylogenetic network from an arbitrary set of rooted triplets is an NP-hard problem. In this paper, we present a heuristic algorithm called TripNet, which tries to construct a rooted phylogenetic network with the minimum number of reticulation nodes from an arbitrary set of rooted triplets. Despite of current methods that work for dense set of rooted triplets, a key innovation is the applicability of TripNet to non-dense set of rooted triplets. We prove some theorems to clarify the performance of the algorithm. To demonstrate the efficiency of TripNet, we compared TripNet with SIMPLISTIC. It is the only available software which has the ability to return some rooted phylogenetic network consistent with a given dense set of rooted triplets. But the results show that for complex networks with high levels, the SIMPLISTIC running time increased abruptly. However in all cases TripNet outputs an appropriate rooted phylogenetic network in an acceptable time. Also we tetsed TripNet on the Yeast data. The results show that Both TripNet and optimal networks have the same clustering and TripNet produced a level-3 network which contains only one more reticulation node than the optimal network.

Download TeX format
back to top
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
scroll left or right