Sciweavers

440 search results - page 37 / 88
» Comparison of Galled Trees
Sort
View
ICMLA
2007
13 years 10 months ago
Machine learned regression for abductive DNA sequencing
We construct machine learned regressors to predict the behaviour of DNA sequencing data from the fluorescent labelled Sanger method. These predictions are used to assess hypothes...
David Thornley, Maxim Zverev, Stavros Petridis
BIOCOMP
2006
13 years 10 months ago
PAC: Progressive Alignment with Consensus Sequences
Computation of multiple sequence alignments is one of the major open problems in computational molecular biology. The purpose of this study was to provide a new method, PAC (Progre...
Ke Liu, Mansur H. Samadzadeh
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 9 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
GECCO
2003
Springer
14 years 1 months ago
Identifying Structural Mechanisms in Standard Genetic Programming
This paper presents a hypothesis about an undiscovered class of mechanisms that exist in standard GP. Rather than being intentionally designed, these mechanisms would be an uninten...
Jason M. Daida, Adam M. Hilss
CCL
1994
Springer
14 years 24 days ago
How to Win a Game with Features
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...
Rolf Backofen, Ralf Treinen