Naive binning improves phylogenomic analyses
Author(s) -
Md. Shamsuzzoha Bayzid,
Tandy Warnow
Publication year - 2013
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btt394
Subject(s) - coalescent theory , concatenation (mathematics) , phylogenetic tree , tree (set theory) , computer science , supertree , tree rearrangement , sorting , scalability , phylogenetic network , algorithm , computational biology , biology , pattern recognition (psychology) , artificial intelligence , data mining , gene , mathematics , genetics , combinatorics , database
Species tree estimation in the presence of incomplete lineage sorting (ILS) is a major challenge for phylogenomic analysis. Although many methods have been developed for this problem, little is understood about the relative performance of these methods when estimated gene trees are poorly estimated, owing to inadequate phylogenetic signal.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom