Sciweavers

1099 search results - page 17 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
DAM
2007
153views more  DAM 2007»
14 years 9 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple
EVOW
2007
Springer
15 years 3 months ago
Toward Greater Artistic Control for Interactive Evolution of Images and Animation
We present several practical improvements to the interactive evolution of 2D images, some of which are also applicable to more general genetic programming problems. We introduce tr...
David A. Hart
ISBRA
2010
Springer
14 years 8 months ago
A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure
The random accumulation of variations in the human genome over time implicitly encodes a history of how human populations have arisen, dispersed, and intermixed since we emerged as...
Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell S...
ISMB
1998
14 years 11 months ago
Phylogenetic Inference in Protein Superfamilies: Analysis of SH2 Domains
This workfocuses on the inference of evolutionary relationships in protein superfamilies, and the uses of these relationships to identify keypositions in the structure, to infer a...
Kimmen Sjölander
JACM
2006
99views more  JACM 2006»
14 years 9 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller