Sciweavers

118 search results - page 23 / 24
» Efficient mining of frequent sequence generators
Sort
View
KDD
2007
ACM
566views Data Mining» more  KDD 2007»
14 years 11 months ago
IMDS: intelligent malware detection system
The proliferation of malware has presented a serious threat to the security of computer systems. Traditional signature-based antivirus systems fail to detect polymorphic and new, ...
Yanfang Ye, Dingding Wang, Tao Li, Dongyi Ye
RECOMB
2010
Springer
13 years 8 months ago
Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
Raluca Uricaru, Alban Mancheron, Eric Rivals
IC
2004
14 years 7 days ago
A Scheme for Personalized Bookmark Services in a Mobile Agent Environment
Recent popularity of web-enabled mobile devices such as handheld devices and PDAs has made mobile Internet access very popular. However, considering the limitation of mobile devic...
Sohryun Shin, Eenjun Hwang
BMCBI
2005
246views more  BMCBI 2005»
13 years 10 months ago
ParPEST: a pipeline for EST data analysis based on parallel computing
Background: Expressed Sequence Tags (ESTs) are short and error-prone DNA sequences generated from the 5' and 3' ends of randomly selected cDNA clones. They provide an im...
Nunzio D'Agostino, Mario Aversano, Maria Luisa Chi...
CIKM
2008
Springer
14 years 25 days ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han