Sciweavers

995 search results - page 22 / 199
» String Pattern Discovery
Sort
View
KDD
2007
ACM
151views Data Mining» more  KDD 2007»
14 years 8 months ago
Efficient mining of iterative patterns for software specification discovery
Studies have shown that program comprehension takes up to 45% of software development costs. Such high costs are caused by the lack-of documented specification and further aggrava...
Chao Liu 0001, David Lo, Siau-Cheng Khoo
BIRD
2008
Springer
221views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Comparison of Exact String Matching Algorithms for Biological Sequences
Exact matching of single patterns in DNA and amino acid sequences is studied. We performed an extensive experimental comparison of algorithms presented in the literature. In additi...
Petri Kalsi, Hannu Peltola, Jorma Tarhio
IPL
2007
91views more  IPL 2007»
13 years 7 months ago
Simple deterministic wildcard matching
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
Peter Clifford, Raphaël Clifford
JCB
2007
118views more  JCB 2007»
13 years 7 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
FGR
2004
IEEE
133views Biometrics» more  FGR 2004»
13 years 11 months ago
Finding Temporal Patterns by Data Decomposition
We present a new unsupervised learning technique for the discovery of temporal clusters in large data sets. Our method performs hierarchical decomposition of the data to find stru...
David C. Minnen, Christopher Richard Wren