654 search results - page 28 / 131 » On the Approximation of Computing Evolutionary Trees |
RECOMB
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. This paper presents an algorithm to detect lateral gene transfer (LGT) on the basis of pairwise evolutionary distances. The prediction is made from a likelihood ratio der...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
This paper introduces a procedure based on genetic programming to evolve XSLT programs (usually called stylesheets or logicsheets). XSLT is a general purpose, document-oriented fu...
EUROGP
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. When researchers make alterations to the genetic programming algorithm they almost invariably wish to measure the change in performance of the evolutionary system. No one...
RECOMB
2006
Springer
15 years 10 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
RECOMB
2010
Springer
14 years 7 months ago
2010
Springer
(Motivation) Tree reconciliation is an approach that explains the discrepancies between two evolutionary trees by a number of events such as speciations, duplications, transfers an...