8695 search results - page 1615 / 1739 » Making the Complex Simple |
118
Voted
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
133
click to vote
RECOMB
2004
Springer
16 years 3 months ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
135
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
130
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
133
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...