log in  |  register  |  feedback?  |  help  |  web accessibility
Logo
Assembling the Tree of Life in Light of Conflicting Signals
Iribe Center, Room 4105 (zoom link: https://umd.zoom.us/j/99192380702)
Thursday, September 7, 2023, 2:00-3:00 pm Calendar
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
Abstract

The genomic era has reached the point where tasks that seemed imaginary only a decade ago are now within reach. One such task, that is among the most fundamentals in biology, is the inference of the evolutionary history for tens of thousands of species, sometimes of very close origin. Such a history is depicted in a tree structure and is called a phylogeny or a phylogenetic tree. In prokaryotes however, the validity of such a tree has been questioned significantly. This is primarily due to the phenomenon of horizontal gene transfer (HGT), the transfer of genetic material not through lineal descent. HGT links between distantly related species, obfuscating the vertical signal of evolution.

 

Quartets, trees over four leaves, are the minimal informational phylogenetic unit and stand at the heart of almost any phylogenetic task, in particular when conflicting signals arise. Besides, and perhaps due to their rudimentary role, quartet-based phylogenetic approaches offer combinatorially/statistically clean problems yet highly relevant to topical questions in evolution. In a series of works we have developed a graph theoretically based approach for the quartets amalgamation task. Our approach is based on a divide and conquer algorithm, where the divide step is based on solving a MaxCut in a special graph we construct. Besides providing a very fast and accurate heuristic for phylogenetics, the cleanliness of this approach has also advanced a more than thirty years open problem of quartets’ compatibility. Additionally, I will survey HGT geared quartets approaches that provide provably guarantees to popular approaches in genomics and metagenomics.  

 

The talk is self contained and assumes no knowledge in biology.

Bio

Sagi Snir graduated in Computer Science from the Technion Israel, focusing on analytical, algebraic, maximum likelihood solutions to phylogenetics. After a postdoc in Math and Computer Science depts at UC Berkeley, he returned to the University of Haifa in Israel, where he has established the Bioinformatics program for grad students. He is now a professor of computational evolution at the University of Haifa and the President of the Israeli Society for Bioinformatics and Computational Biology. 

His research combines algorithmic and combinatorial/statistical approaches to problems from evolution with focus on phylogenetic trees and networks. He has developed the Quartet MaxCut algorithm to combine conflicting signals between evolutionary trees and other fundamental results on maximum likelihood of trees and networks. 

His papers have been published in both leading pure theoretical computer science venues and pure evolution venues.

This talk is organized by Erin Molloy