Maximum likelihood models and algorithms for gene tree evolution with duplications and losses
2011

New Methods for Gene Tree Evolution

publication Evidence: high

Author Information

Author(s): Górecki Pawel, Burleigh Gordon J, Eulenstein Oliver

Primary Institution: Institute of Informatics, Warsaw University

Hypothesis

Can maximum likelihood models effectively estimate gene duplication and loss events in gene trees?

Conclusion

The DrML program efficiently identifies optimal gene duplication and loss scenarios in gene trees, differing from traditional parsimony methods.

Supporting Evidence

  • DrML can find optimal gene duplication and loss scenarios within minutes.
  • The algorithm was tested on both empirical and simulated data.
  • DrML identifies maximum likelihood gene tree reconciliations effectively.
  • The approach incorporates evolutionary time into gene tree reconciliations.

Takeaway

This study created a computer program that helps scientists understand how genes change over time by looking at how often they duplicate or disappear.

Methodology

The study developed a maximum likelihood model and an algorithm implemented in the DrML program to analyze gene trees and species trees.

Limitations

The approach may be misled by errors in gene trees and has a high computational cost.

Digital Object Identifier (DOI)

10.1186/1471-2105-12-S1-S15

Want to read the original?

Access the complete publication on the publisher's website

View Original Publication