Sciweavers

136 search results - page 11 / 28
» Finding Approximate Repeating Patterns from Sequence Data
Sort
View
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 8 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
TASLP
2008
141views more  TASLP 2008»
13 years 7 months ago
Unsupervised Pattern Discovery in Speech
We present a novel approach to speech processing based on the principle of pattern discovery. Our work represents a departure from traditional models of speech recognition, where t...
A. S. Park, J. R. Glass
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 8 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
BMCBI
2010
133views more  BMCBI 2010»
13 years 8 months ago
Improving de novo sequence assembly using machine learning and comparative genomics for overlap correction
Background: With the rapid expansion of DNA sequencing databases, it is now feasible to identify relevant information from prior sequencing projects and completed genomes and appl...
Lance E. Palmer, Mathäus Dejori, Randall A. B...
BMCBI
2007
190views more  BMCBI 2007»
13 years 8 months ago
Discriminative motif discovery in DNA and protein sequences using the DEME algorithm
Background: Motif discovery aims to detect short, highly conserved patterns in a collection of unaligned DNA or protein sequences. Discriminative motif finding algorithms aim to i...
Emma Redhead, Timothy L. Bailey