Sentence examples for frequent sequences that from inspiring English sources

Mining all frequent sequences that have supports above the minimum support threshold (minSup).

The mining process is usually decomposed into two phases: (1) Mining all frequent sequences that have supports above the minimum support threshold (minSup)   (2) Generating the desired rules from the frequent sequences if they also satisfy the minimum confidence threshold (minConf).

Moreover, there are approaches that do not distinguish accidental (less frequent) sequences from sequences that can be really seen as patterns, providing less useful recommendations.

3 5 Previous in vitro studies have reported frequent ISR resulting in sequences that are mosaics between donor and recipient.

Our data indicates that at a q = 30, filtering single nt mismatch sequences that are less frequent than 1% of a high frequency index sequence reliably purges >98% of residual erroneous sequences.

This holds particularly true for fluvial sedimentary rock sequences that are characterized by frequent changes of rock properties, both laterally and vertically (Morad et al. 2010).

Within CC5 and CC30 previously associated with clinical outcome [9], there were 1232 (61%) sequences that differed in frequency, with 731 (38%) being more frequent in CC30 and 461 (23%) more frequent in CC5 (Table S2).

To assess IRES sequence conservation across HCV isolates, nucleotide sequences of 45 clones from 9 HCV subjects were determined (and the most frequent sequence for the clones that belongs to each subject was selected) and the sequences that constitute the target domains for S-ODN1 and S-ODN2 were aligned using multiple sequence alignment programs ClustalW.

The later are sequences that were separated from the initial TdT-labeled break site by subsequent restriction digestion using a frequent cutting enzyme Bsp1286I.

A frequent scenario in research is a biologist having a particular sequence of interest in hands that needs to find other sequences that are related to it in sequence databases to create a phylogenetic tree.

In this paper we present and study a variety of distributed-memory parallel algorithms for a tree-projection-based frequent sequence discovery algorithm that are able to minimize the various overheads associated with load imbalance, database overlap, and interprocessor communication.