Sciweavers

541 search results - page 16 / 109
» An Efficient Algorithm for the Longest Pattern Subsequence P...
Sort
View
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
13 years 8 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
SAC
2006
ACM
14 years 2 months ago
Looking for monotonicity properties of a similarity constraint on sequences
Constraint-based mining techniques on sequence databases have been studied extensively the last few years and efficient algorithms enable to compute complete collections of patte...
Ieva Mitasiunaite, Jean-François Boulicaut
IPPS
1998
IEEE
14 years 1 months ago
Randomization in Parallel Stringology
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
S. Muthukrishnan
SPAA
2006
ACM
14 years 2 months ago
The cache complexity of multithreaded cache oblivious algorithms
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
Matteo Frigo, Volker Strumpen
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
14 years 4 days ago
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
Binhai Zhu