Sciweavers

686 search results - page 42 / 138
» Inexact pattern matching using genetic algorithm
Sort
View
JGAA
2007
135views more  JGAA 2007»
13 years 7 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
BMCBI
2008
129views more  BMCBI 2008»
13 years 8 months ago
Triad pattern algorithm for predicting strong promoter candidates in bacterial genomes
Background: Bacterial promoters, which increase the efficiency of gene expression, differ from other promoters by several characteristics. This difference, not yet widely exploite...
Michael Dekhtyar, Amelie Morin, Vehary Sakanyan
ISMIR
2004
Springer
138views Music» more  ISMIR 2004»
14 years 1 months ago
MusicBLAST - Gapped Sequence Alignment for MIR
We propose an algorithm, MusicBLAST, for approximate pattern search/matching on symbolic musical data. MusicBLAST is based on the BLAST algorithm, one of the most commonly used al...
Jürgen Kilian, Holger H. Hoos
DMIN
2006
142views Data Mining» more  DMIN 2006»
13 years 9 months ago
Parallel Hybrid Clustering using Genetic Programming and Multi-Objective Fitness with Density (PYRAMID)
Clustering is the process of locating patterns in large data sets. It is an active research area that provides value to scientific as well as business applications. Practical clust...
Junping Sun, William Sverdlik, Samir Tout
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 9 hour ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers