Our commentary on Douglas Theobald's test from Universal Common Ancestry (UCA) just went online. The original idea was to make a user-friendly review of his analysis described in "A formal test of the theory of universal common ancestry", but after a long e-mail exchange between Douglas and us -- actually between him and David, I didn't say much -- we decided to expand the article to include some remaining points of skepticism and spell out the basic problem with his approach.His work His test f........ Read more »
Leonardo de Oliveira Martins, David Posada. (2012) Proving universal common ancestry with similar sequences. Trends in Evolutionary Biology, 14(1). info:/10.4081/eb.2012.e5
Theobald, D. (2010) A formal test of the theory of universal common ancestry. Nature, 465(7295), 219-222. DOI: 10.1038/nature09014
After running a Bayesian phylogenetic analysis we are usually left with a large collection of trees, that came from the posterior distribution of the model given our data. Then if we want to work with a single tree - that is, to have a point estimate of this posterior distribution of trees - the most usual ways are to calculate the consensus tree or to select the most frequent tree. There are other ways, but let's fix on those by now.We might not be aware of it, but when we choose for one or ano........ Read more »
I just came back from SMBE2010, where I presented a poster about our recombination detection software and had the chance to see awesome research other people are doing. The poster can be downloaded here (1.MB in pdf format) and I’m distributing it under the Creative Commons License. Given the great feedback I got from other [...]... Read more »
de Oliveira Martins, L., Leal, É., & Kishino, H. (2008) Phylogenetic Detection of Recombination with a Bayesian Prior on the Distance between Trees. PLoS ONE, 3(7). DOI: 10.1371/journal.pone.0002651
Oliveira Martins, L., & Kishino, H. (2009) Distribution of distances between topologies and its effect on detection of phylogenetic recombination. Annals of the Institute of Statistical Mathematics, 62(1), 145-159. DOI: 10.1007/s10463-009-0259-8
In recent years there has been an explosion of parallel algorithms for solving bioinformatics problems, namely phylogenetic reconstruction and sequence alignment. These algorithms follow the growth of new hardware solutions like Field-Programmable Gate Arrays (integrated circuits capable of performing simple instructions in parallel), Cell microprocessors (like the one inside Playstation 3), Graphics Processing Units (nvidia [...]... Read more »
Galvez, S., Diaz, D., Hernandez, P., Esteban, F., Caballero, J., & Dorado, G. (2010) Next-generation bioinformatics: using many-core processor architecture to develop a web service for sequence alignment. Bioinformatics, 26(5), 683-686. DOI: 10.1093/bioinformatics/btq017
Manavski, S., & Valle, G. (2008) CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment. BMC Bioinformatics, 9(Suppl 2). DOI: 10.1186/1471-2105-9-S2-S10
Do you write about peer-reviewed research in your blog? Use ResearchBlogging.org to make it easy for your readers — and others from around the world — to find your serious posts about academic research.
If you don't have a blog, you can still use our site to learn about fascinating developments in cutting-edge research from around the world.
Research Blogging is powered by SMG Technology.
To learn more, visit seedmediagroup.com.