Sciweavers

583 search results - page 36 / 117
» New algorithms for efficient parallel string comparison
Sort
View
JMIV
2006
130views more  JMIV 2006»
15 years 1 months ago
Alternative 2D Shape Representations using the Symmetry Set
Among the many attempts made to represent families of 2D shapes in a simpler way, the Medial Axis (MA) takes a prominent place. Its graphical representation is intuitively appealin...
Arjan Kuijper, Ole Fogh Olsen, Peter J. Giblin, Ma...
ALMOB
2008
131views more  ALMOB 2008»
15 years 2 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
HM
2005
Springer
97views Optimization» more  HM 2005»
15 years 7 months ago
Comparing Parallelization of an ACO: Message Passing vs. Shared Memory
We present a shared memory approach to the parallelization of the Ant Colony Optimization (ACO) metaheuristic and a performance comparison with an existing message passing implemen...
Pierre Delisle, Marc Gravel, Michaël Krajecki...
CORR
2007
Springer
81views Education» more  CORR 2007»
15 years 1 months ago
Faster exon assembly by sparse spliced alignment
Assembling a gene from candidate exons is an important problem in computational biology. Among the most successful approaches to this problem is spliced alignment, proposed by Gelf...
Alexandre Tiskin
101
Voted
AIPS
2009
15 years 3 months ago
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou