Sciweavers

164 search results - page 14 / 33
» Parallel Tree Projection Algorithm for Sequence Mining
Sort
View
SAC
2004
ACM
14 years 25 days ago
A parallel algorithm for the extraction of structured motifs
In this work we propose a parallel algorithm for the efficient extraction of binding-site consensus from genomic sequences. This algorithm, based on an existing approach, extracts...
Alexandra M. Carvalho, Arlindo L. Oliveira, Ana T....
ICWE
2004
Springer
14 years 24 days ago
Behaviour Recovery and Complicated Pattern Definition in Web Usage Mining
Data mining includes four steps: data preparation, pattern mining, and pattern analysis and pattern application. But in web environment, the user activities become much more comple...
Long Wang 0002, Christoph Meinel
WWW
2011
ACM
13 years 2 months ago
Growing parallel paths for entity-page discovery
In this paper, we use the structural and relational information on the Web to find entity-pages. Specifically, given a Web site and an entity-page (e.g., department and faculty ...
Tim Weninger, Fabio Fumarola, Cindy Xide Lin, Rick...
IWOCA
2010
Springer
219views Algorithms» more  IWOCA 2010»
13 years 2 months ago
Efficient Chaining of Seeds in Ordered Trees
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
Julien Allali, Cedric Chauve, Pascal Ferraro, Anne...
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
14 years 21 days ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu