title: Fast algorithms and heuristics for phylogenomics under ILS and hybridization.
abstract: BACKGROUND
  Phylogenomic analyses involving whole-genome or multi-locus data often entail dealing with incongruent gene trees. In this paper, we consider two causes of such incongruence, namely, incomplete lineage sorting (ILS) and hybridization, and consider both parsimony and probabilistic criteria for dealing with them.
  
  
  RESULTS
  Under the assumption of ILS, computing the probability of a gene tree given a species tree is a very hard problem. We present a heuristic for speeding up the computation, and demonstrate how it scales up computations to data sizes that are not feasible to analyze using current techniques, while achieving very good accuracy. Further, under the assumption of both ILS and hybridization, computing the probability of a gene tree and parsimoniously reconciling it with a phylogenetic network are both very hard problems. We present two exact algorithms for these two problems that speed up existing techniques significantly and enable analyses of much larger data sets than is currently feasible.
  
  
  CONCLUSIONS
  Our heuristics and algorithms enable phylogenomic analyses of larger (in terms of numbers of taxa) data sets than is currently feasible. Further, our methods account for ILS and hybridization, thus allowing analyses of reticulate evolutionary histories.
authors.forename: Yun
authors.initials: Y
authors.lastname: Yu
authors.forename: Nikola
authors.initials: N
authors.lastname: Ristic
authors.forename: Luay
authors.initials: L
authors.lastname: Nakhleh
mesh_terms: D000465:Algorithms; D005075:Biological Evolution; D005240:Feasibility Studies; D016678:Genome; D023281:Genomics; D006824:Hybridization, Genetic; D010802:Phylogeny; D011336:Probability