95 search results - page 19 / 19 » Efficient Enumeration of Frequent Sequences |
BMCBI
2007
13 years 5 months ago
2007
Background: In the analysis of networks we frequently require the statistical significance of some network statistic, such as measures of similarity for the properties of interact...
TCS
2008
13 years 5 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
BMCBI
2004
13 years 5 months ago
2004
Background: Eukaryotic whole genome sequences are accumulating at an impressive rate. Effective methods for comparing multiple whole eukaryotic genomes on a large scale are needed...
VLDB
2005
ACM
14 years 5 months ago
2005
ACM
The traditional model of bench (wet) chemistry in many life sciences domain is today actively complimented by computer-based discoveries utilizing the growing number of online data...
SDM
2010
SIAM
13 years 6 months ago
2010
SIAM
Given a collection of Boolean spatio-temporal(ST) event types, the cascading spatio-temporal pattern (CSTP) discovery process finds partially ordered subsets of event-types whose ...