Related Experiment Video
Updated: Mar 10, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
Published on: October 11, 2018
A New Efficient Algorithm for the Frequent Gene Team Problem
Abstract:
The focus of this paper is the frequent gene team problem. Given a quorum parameter μ and a set of m genomes, the problem is to find gene teams that occur in at least μ of the given genomes. In this paper, a new algorithm is presented. Previous solutions are efficient only when μ is small. Unlike previous solutions, the presented algorithm does not rely on examining every combination of μ genomes. Its time complexity is independent of μ. Under some realistic assumptions, the practical running time is estimated to be , where n is the maximum length of the input genomes. Experiments showed that the presented algorithm is extremely efficient. For any μ, it takes less than 1 second to process 100 bacterial genomes and takes only 10 minutes to process 2,000 genomes. The presented algorithm can be used as an effective tool for large scale genome analyses.
More Related Videos
Related Concept Videos
Expected Frequencies in Goodness-of-Fit Tests
Quantifying and Rejecting Outliers: The Grubbs Test
Unusual Results
According to the range rule of thumb, any value above or below two standard deviations, 2σ from the mean, μ is considered unusual.
Maximum unusual value =...
Wald-Wolfowitz Runs Test I
The test works...
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Multi-species Conserved Sequences
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved...

