Sciweavers

131 search results - page 24 / 27
» combinatorics 2004
Sort
View
DAM
2007
153views more  DAM 2007»
13 years 10 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple
CPM
2004
Springer
108views Combinatorics» more  CPM 2004»
14 years 4 months ago
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
Thomas Schmidt, Jens Stoye
MMAS
2004
Springer
14 years 4 months ago
Quantitative Organizational Models for Large-Scale Agent Systems
Abstract. As the scale and scope of multi-agent systems grow, it becomes increasingly important to design and manage the manner in which the participants interact. The potential fo...
Bryan Horling, Victor R. Lesser
CPM
2004
Springer
84views Combinatorics» more  CPM 2004»
14 years 4 months ago
Small Phylogeny Problem: Character Evolution Trees
Abstract. Phylogenetics is a science of determining connections between groups of organisms in terms of ancestor/descendent relationships, usually expressed by phylogenetic trees, ...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
COMPGEOM
2004
ACM
14 years 4 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...