Sciweavers

4137 search results - page 10 / 828
» On the number of matchings of a tree
Sort
View
BICOB
2009
Springer
14 years 2 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...
MICCAI
2007
Springer
14 years 8 months ago
Deformable Density Matching for 3D Non-rigid Registration of Shapes
There exists a large body of literature on shape matching and registration in medical image analysis. However, most of the previous work is focused on matching particular sets of f...
Arunabha S. Roy, Ajay Gopinath, Anand Rangarajan
RECOMB
2004
Springer
14 years 8 months ago
Multiple Genome Alignment by Clustering Pairwise Matches
We have developed a multiple genome alignment algorithm by using a sequence clustering algorithm to combine local pairwise genome sequence matches produced by pairwise genome align...
Jeong-Hyeon Choi, Kwangmin Choi, Hwan-Gue Cho, Sun...
EUROGP
2005
Springer
114views Optimization» more  EUROGP 2005»
14 years 1 months ago
Repeated Patterns in Tree Genetic Programming
We extend our analysis of repetitive patterns found in genetic programming genomes to tree based GP. As in linear GP, repetitive patterns are present in large numbers. Size fair cr...
William B. Langdon, Wolfgang Banzhaf
COMPGEOM
2000
ACM
14 years 4 hour ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk