Search National Agricultural Library Digital Collections
Back to Search
NALDC Record Details:
Parallelized Binary Search Tree
Download [PDF File]
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 insertion 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.
Daniel Q. Naiman
USDA Scientist Submission
Journal of Information Technology & Software Engineering 2011 Nov. v.1 no.1
Journal Articles, USDA Authors, Peer-Reviewed
Works produced by employees of the U.S. Government as part of their official duties are not copyrighted within the U.S. The content of this document is not copyrighted.
Agricultural Research Service
Web Policies and Important Links