• Login
    View Item 
    •   Athenaeum Home
    • BioMed Central Open Access Articles
    • Open Access Articles by UGA Faculty
    • View Item
    •   Athenaeum Home
    • BioMed Central Open Access Articles
    • Open Access Articles by UGA Faculty
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Computing all hybridization networks for multiple binary phylogenetic input trees

    Thumbnail
    View/Open
    12859_2015_Article_660.pdf (1.189Mb)
    Date
    2015-07-30
    Author
    Albrecht, Benjamin
    Metadata
    Show full item record
    Abstract
    Abstract Background The computation of phylogenetic trees on the same set of species that are based on different orthologous genes can lead to incongruent trees. One possible explanation for this behavior are interspecific hybridization events recombining genes of different species. An important approach to analyze such events is the computation of hybridization networks. Results This work presents the first algorithm computing the hybridization number as well as a set of representative hybridization networks for multiple binary phylogenetic input trees on the same set of taxa. To improve its practical runtime, we show how this algorithm can be parallelized. Moreover, we demonstrate the efficiency of the software Hybroscale, containing an implementation of our algorithm, by comparing it to PIRNv2.0, which is so far the best available software computing the exact hybridization number for multiple binary phylogenetic trees on the same set of taxa. The algorithm is part of the software Hybroscale, which was developed specifically for the investigation of hybridization networks including their computation and visualization. Hybroscale is freely available1 and runs on all three major operating systems. Conclusion Our simulation study indicates that our approach is on average 100 times faster than PIRNv2.0. Moreover, we show how Hybroscale improves the interpretation of the reported hybridization networks by adding certain features to its graphical representation.
    URI
    http://dx.doi.org/10.1186/s12859-015-0660-7
    http://hdl.handle.net/10724/31924
    Collections
    • Open Access Articles by UGA Faculty

    About Athenaeum | Contact Us | Send Feedback
     

     

    Browse

    All of AthenaeumCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    About Athenaeum | Contact Us | Send Feedback