Sciweavers

1347 search results - page 197 / 270
» Using Clustering Methods for Discovering Event Structures
Sort
View
BMCBI
2006
111views more  BMCBI 2006»
15 years 3 months ago
High throughput profile-profile based fold recognition for the entire human proteome
Background: In order to maintain the most comprehensive structural annotation databases we must carry out regular updates for each proteome using the latest profile-profile fold r...
Liam J. McGuffin, Richard T. Smith, Kevin Bryson, ...
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 6 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh
BMCBI
2010
121views more  BMCBI 2010»
15 years 3 months ago
Knowledge-based annotation of small molecule binding sites in proteins
Background: The study of protein-small molecule interactions is vital for understanding protein function and for practical applications in drug discovery. To benefit from the rapi...
Ratna R. Thangudu, Manoj Tyagi, Benjamin A. Shoema...
NAA
2004
Springer
117views Mathematics» more  NAA 2004»
15 years 8 months ago
Parallel Performance of a 3D Elliptic Solver
It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D or 3D elliptic prob...
Ivan Lirkov
NIPS
2008
15 years 4 months ago
Adaptive Template Matching with Shift-Invariant Semi-NMF
How does one extract unknown but stereotypical events that are linearly superimposed within a signal with variable latencies and variable amplitudes? One could think of using temp...
Jonathan Le Roux, Alain de Cheveigné, Lucas...