Sciweavers

1099 search results - page 10 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
METMBS
2004
140views Mathematics» more  METMBS 2004»
14 years 11 months ago
New Techniques for Generation and Analysis of Evolutionary Trees
We introduce new distance measures for the construction and analysis of phylogenies, focusing on thioredoxin-fold proteins. Our distance measures for tree construction are based o...
Chang Wang, Stephen D. Scott, Qingping Tao, Dmitri...
CVIU
2011
14 years 1 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
BMCBI
2005
100views more  BMCBI 2005»
14 years 9 months ago
Scoredist: A simple and robust protein sequence distance estimator
Background: Distance-based methods are popular for reconstructing evolutionary trees thanks to their speed and generality. A number of methods exist for estimating distances from ...
Erik L. L. Sonnhammer, Volker Hollich
BIOINFORMATICS
2010
109views more  BIOINFORMATICS 2010»
14 years 9 months ago
Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters
Phylogenetic trees are widely used to display estimates of how groups of species evolved. Each phylogenetic tree can be seen as a collection of clusters, subgroups of the species ...
Leo van Iersel, Steven Kelk, Regula Rupp, Daniel H...