Related Experiment Video
Updated: Aug 10, 2026

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
Published on: December 7, 2021
An algorithm to count the number of repeated patient data entries with B tree
Abstract:
An algorithm to obtain the number of different values that appear a specified number of times in a given data field of a given data file is presented. Basically, a well-known B-tree structure is employed in this study. Some modifications were made to the basic B-tree algorithm. The first step of the modifications is to allow a data item whose values are not necessary distinct from one record to another to be used as a primary key. When a key value is inserted, the number of previous appearances is counted. At the end of all the insertions, the number of key values which are unique in the tree, the number of key values which appear twice, three times, and so forth are obtained. This algorithm is especially powerful for a large size file in disk storage.
Related Concept Videos
Pedigree Analysis
Wald-Wolfowitz Runs Test I
The test works...
Kaplan-Meier Approach
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
Binomial Expansion Using Pascal's Triangle

