Skip to main navigation Skip to search Skip to main content

An ultrafast tool for minimum reticulate networks

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

Due to hybridization events in evolution, studying different genes of a set of species may yield two or more related but different phylogenetic trees for the set of species. In this case, we want to combine the trees into a reticulate network with the fewest hybridization events. In this article, we develop a software tool (named UltraNet) for several fundamental problems related to the construction of minimum reticulate networks from two or more phylogenetic trees. Our experimental results show that UltraNet is much faster than all previous tools for these problems. © 2013 Mary Ann Liebert, Inc.
Original languageEnglish
Pages (from-to)38-41
JournalJournal of Computational Biology
Volume20
Issue number1
DOIs
Publication statusPublished - 1 Jan 2013

Research Keywords

  • (acyclic) agreement forest
  • hybridization number
  • phylogenetic tree
  • reticulate network
  • rSPR distance

Fingerprint

Dive into the research topics of 'An ultrafast tool for minimum reticulate networks'. Together they form a unique fingerprint.

Cite this