712 search results - page 4 / 143 » The Complexity of Constructing Evolutionary Trees Using Expe... |
GECCO
2003
Springer
13 years 11 months ago
2003
Springer
Phylogenetics has gained in public favor for the analysis of DNA sequence data as molecular biology has advanced. Among a number of algorithms for phylogenetics, the fastDNAml is c...
EMMCVPR
2001
Springer
13 years 10 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
BMCBI
2008
13 years 6 months ago
2008
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
PAMI
1998
13 years 5 months ago
1998
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
Evolutionary algorithms have successfully been applied to software testing. Not only approaches that search for numeric test data for procedural test objects have been investigate...