Sciweavers

1315 search results - page 89 / 263
» Discovering significant rules
Sort
View
BMCBI
2004
88views more  BMCBI 2004»
15 years 4 months ago
PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences
Background: This paper addresses the problem of discovering transcription factor binding sites in heterogeneous sequence data, which includes regulatory sequences of one or more g...
Saurabh Sinha, Mathieu Blanchette, Martin Tompa
FUZZIEEE
2007
IEEE
15 years 10 months ago
Decoding Trace Peak Behaviour - A Neuro-Fuzzy Approach
— DNA sequence basecalling is commonly regarded as a solved problem, despite significant error rates being reflected in inaccuracies in databases and genome annotations. This has...
David Thornley, Stavros Petridis
SIGCOMM
2010
ACM
15 years 4 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...
COMPSAC
2003
IEEE
15 years 9 months ago
A Supervised Visual Wrapper Generator for Web-Data Extraction
Extracting data from Web pages using wrappers is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper, we propose a novel sch...
Xiaofeng Meng, Haiyan Wang, Dongdong Hu, Chen Li
FASE
2008
Springer
15 years 6 months ago
A Logic of Graph Constraints
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
Fernando Orejas, Hartmut Ehrig, Ulrike Prange