Sciweavers

3604 search results - page 12 / 721
» All Common Subsequences
Sort
View
ICPR
2010
IEEE
13 years 10 months ago
Normalized Sum-Over-Paths Edit Distances
Abstract--In this paper, normalized SoP string-edit distances, taking into account all possible alignments between two sequences, are investigated. These normalized distances are v...
Silvia García, François Fouss, Masashi Shimbo, M...
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
13 years 5 months ago
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo
PODC
2000
ACM
13 years 11 months ago
Efficient generation of all regular non-dominated coteries
A coterie is a family of subsets such that every pair of subsets in it has at least one element in common but neither is a subset of the other. We introduce an operator , which
Kazuhisa Makino, Tiko Kameda
ICDM
2010
IEEE
276views Data Mining» more  ICDM 2010»
13 years 5 months ago
Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs
Many time series data mining problems require subsequence similarity search as a subroutine. While this can be performed with any distance measure, and dozens of distance measures ...
Doruk Sart, Abdullah Mueen, Walid A. Najjar, Eamon...
ENGL
2007
94views more  ENGL 2007»
13 years 7 months ago
Common subproofs in proof pairs
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
Guillermo Morales-Luna