Sciweavers

1060 search results - page 42 / 212
» On the Discovery of Random Trees
Sort
View
RECOMB
2008
Springer
15 years 10 months ago
Algorithms for Exploring the Space of Gene Tree/Species Tree Reconciliations
We describe algorithms to explore the space of all possible reconciliations between a gene tree and a species tree. We propose an algorithm for generating a random reconciliation, ...
Jean-Philippe Doyon, Cedric Chauve, Sylvie Hamel
GPEM
2000
103views more  GPEM 2000»
14 years 9 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon
JCT
2007
150views more  JCT 2007»
14 years 10 months ago
On the degree distribution of the nodes in increasing trees
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...
Markus Kuba, Alois Panholzer
CSB
2005
IEEE
125views Bioinformatics» more  CSB 2005»
15 years 3 months ago
Discriminative Discovery of Transcription Factor Binding Sites from Location Data
Motivation: The availability of genome-wide location analyses based on chromatin immunoprecipitation (ChIP) data gives a new insight for in silico analysis of transcriptional regu...
Yuji Kawada, Yasubumi Sakakibara
ICDM
2009
IEEE
113views Data Mining» more  ICDM 2009»
15 years 4 months ago
Spatiotemporal Relational Random Forests
Abstract—We introduce and validate Spatiotemporal Relational Random Forests, which are random forests created with spatiotemporal relational probability trees. We build on the do...
Timothy A. Supinie, Amy McGovern, John Williams, J...