Sciweavers

310 search results - page 35 / 62
» Using Parallel Algorithms for Searching Molecular Sequence D...
Sort
View
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 9 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
KDD
2012
ACM
217views Data Mining» more  KDD 2012»
11 years 11 months ago
The long and the short of it: summarising event sequences with serial episodes
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
Nikolaj Tatti, Jilles Vreeken
SPIRE
1999
Springer
14 years 1 months ago
Cross-Domain Approximate String Matching
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
Daniel P. Lopresti, Gordon T. Wilfong
CCECE
2006
IEEE
14 years 2 months ago
Survey of Biological High Performance Computing: Algorithms, Implementations and Outlook Research
During recent years there has been an explosive growth of biological data coming from genome projects, proteomics, protein structure determination, and the rapid expansion in digi...
Nasreddine Hireche, J. M. Pierre Langlois, Gabriel...
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
14 years 2 months ago
A reconfigurable architecture for scanning biosequence databases
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
Timothy F. Oliver, Bertil Schmidt, Douglas L. Mask...