Sciweavers

53 search results - page 11 / 11
» Practical methods for constructing suffix trees
Sort
View
COMPGEOM
2006
ACM
13 years 9 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 9 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
FIMH
2009
Springer
13 years 3 months ago
Discriminative Joint Context for Automatic Landmark Set Detection from a Single Cardiac MR Long Axis Slice
Cardiac magnetic resonance (MR) imaging has advanced to become a powerful diagnostic tool in clinical practice. Automatic detection of anatomic landmarks from MR images is importan...
Xiaoguang Lu, Bogdan Georgescu, Arne Littmann, Edg...