Sciweavers

136 search results - page 2 / 28
» Finding Approximate Repeating Patterns from Sequence Data
Sort
View
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
13 years 3 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
ALMOB
2006
138views more  ALMOB 2006»
13 years 5 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
DATE
2005
IEEE
125views Hardware» more  DATE 2005»
13 years 11 months ago
Hybrid BIST Based on Repeating Sequences and Cluster Analysis
We present a hybrid BIST approach that extracts the most frequently occurring sequences from deterministic test patterns; these extracted sequences are stored on-chip. We use clus...
Lei Li, Krishnendu Chakrabarty
DASFAA
2005
IEEE
191views Database» more  DASFAA 2005»
13 years 11 months ago
An Efficient Approach to Extracting Approximate Repeating Patterns in Music Databases
Pattern extraction from music strings is an important problem. The patterns extracted from music strings can be used as features for music retrieval or analysis. Previous works on ...
Ning-Han Liu, Yi-Hung Wu, Arbee L. P. Chen
CANDC
2000
ACM
13 years 5 months ago
Sequence Complexity for Biological Sequence Analysis
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
Lloyd Allison, Linda Stern, Timothy Edgoose, Trevo...