Multithread Multistring Burrows-Wheeler Transform and Longest Common Prefix Array.

Area of Science:

• Bioinformatics
• Computational Biology
• Data Structures

Background:

• Indexing large string collections, like genomic data, is essential for bioinformatics.
• Multistring generalizations of the Burrows-Wheeler transform (BWT) and longest common prefix (LCP) array are critical for efficient string collection algorithms.
• Current methods for constructing BWT and LCP arrays can be computationally intensive.

Purpose of the Study:

• To develop and explore a multithread computational strategy for building the multistring BWT and LCP array.
• To enhance the efficiency of indexing large collections of strings.
• To provide a foundation for faster genome assembly and other string-based algorithms.

Main Methods:

• A divide and conquer approach is employed for parallel computation.
• The algorithm is designed for multithreaded execution to leverage modern multi-core processors.
• Focus on parallel construction of both the BWT and LCP array.

Main Results:

• The proposed strategy enables parallel computation of the multistring BWT and LCP array.
• This multithreaded approach significantly improves the speed of constructing these essential data structures.
• The method is applicable to large-scale datasets generated by sequencing technologies.

Conclusions:

• The developed multithread computational strategy offers an efficient solution for constructing multistring BWT and LCP arrays.
• This parallel approach is vital for accelerating bioinformatics workflows, including genome assembly.
• The findings contribute to the advancement of computational tools for analyzing massive biological sequence data.