Sciweavers

17 search results - page 1 / 4
» Mining Maximal Flexible Patterns in a Sequence
Sort
View
JSAI
2007
Springer
13 years 11 months ago
Mining Maximal Flexible Patterns in a Sequence
Hiroki Arimura, Takeaki Uno
ICDE
2010
IEEE
750views Database» more  ICDE 2010»
13 years 9 months ago
Efficient and accurate discovery of patterns in sequence datasets
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
Avrilia Floratou, Sandeep Tata, Jignesh M. Patel
DAWAK
2004
Springer
13 years 10 months ago
Mining Maximal Frequently Changing Subtree Patterns from XML Documents
Abstract. Due to the dynamic nature of online information, XML documents typically evolve over time. The change of the data values or structures of an XML document may exhibit some...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
14 years 2 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
BMCBI
2007
164views more  BMCBI 2007»
13 years 5 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason