జర్నల్ ఆఫ్ ఇన్ఫర్మేషన్ టెక్నాలజీ & సాఫ్ట్వేర్ ఇంజనీరింగ్
అందరికి ప్రవేశం

నైరూప్య

A Parallelized Binary Search Tree

Jian Feng, Daniel Q. Naiman and Bret Cooper

PTTRNFNDR is an unsupervised statistical learning algorithm that detects patterns in DNA sequences, protein sequences, or any natural language texts that can be decomposed into letters of a finite alphabet. PTTRNFNDR performs complex mathematical computations, and its processing time increases when input texts become large. To achieve better speed performance, several strategies were applied in the implementation of the program, including parallel operations of binary search trees. A standard binary search tree is not thread-safe due to its dynamic insertions and deletions. Here, we adjusted the standard binary search tree for parallelized operations to achieve improved performance of the PTTRNFNDR algorithm. The method can be applied to other software platforms to quicken data searching through parallel operations of binary search trees when several conditions are met.