Sciweavers

179 search results - page 23 / 36
» Analysis of computational approaches for motif discovery
Sort
View
GCB
2004
Springer
223views Biometrics» more  GCB 2004»
15 years 3 months ago
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
Michael Beckstette, Dirk Strothmann, Robert Homann...
97
Voted
WWW
2008
ACM
16 years 13 days ago
Efficiently finding web services using a clustering semantic approach
Efficiently finding Web services on the Web is a challenging issue in service-oriented computing. Currently, UDDI is a standard for publishing and discovery of Web services, and U...
Jiangang Ma, Yanchun Zhang, Jing He
CN
2000
70views more  CN 2000»
14 years 11 months ago
An efficient algorithm to rank Web resources
How to rank Web resources is critical to Web Resource Discovery (Search Engine). This paper not only points out the weakness of current approaches, but also presents in-depth anal...
Dell Zhang, Yisheng Dong
ICCV
2007
IEEE
16 years 1 months ago
Structure from Statistics - Unsupervised Activity Analysis using Suffix Trees
Models of activity structure for unconstrained environments are generally not available a priori. Recent representational approaches to this end are limited by their computational...
Raffay Hamid, Siddhartha Maddi, Aaron F. Bobick, I...
AIIA
2005
Springer
15 years 5 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut