136 search results - page 5 / 28 » Finding Approximate Repeating Patterns from Sequence Data |
BMCBI
2008
13 years 8 months ago
2008
Background: Identification of approximate tandem repeats is an important task of broad significance and still remains a challenging problem of computational genomics. Often there ...
ADBIS
2000
Springer
14 years 5 days ago
2000
Springer
Conducting data mining on logs of web servers involves the determination of frequently occurring access sequences. We examine the problem of finding traversal patterns from web lo...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
We present a computational framework to automatically discover high-order temporal social patterns from very noisy and sparse location data. We introduce the concept of social foo...
JCO
2006
13 years 7 months ago
2006
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...