An optimized data structure for high-throughput 3D proteomics data: mzRTree

Area of Science:

• Proteomics
• Bioinformatics
• Data Management

Background:

• Mass spectrometry (MS)-based proteomics is an emerging field requiring efficient data management tools.
• Current methods for storing and accessing LC-MS data, often in XML formats, are inefficient for high-throughput datasets.
• LC-MS data analysis frequently involves 2D range queries, necessitating optimized data structures.

Purpose of the Study:

• To propose a novel data structure, mzRTree, for efficient management of LC-MS datasets.
• To optimize the performance of 2D range queries on large-scale LC-MS data.
• To reduce the computational costs associated with analyzing large profile datasets in proteomics.

Main Methods:

• Development of mzRTree, a scalable index based on the R-tree data structure.
• Implementation of mzRTree for efficient creation from standard XML-based LC-MS data formats.
• Experimental evaluation of mzRTree's performance on range queries compared to existing structures.

Main Results:

• mzRTree demonstrates superior performance across all tested range queries compared to existing data structures for LC-MS data.
• The proposed mzRTree is more space-efficient than alternative structures.
• mzRTree effectively handles very large LC-MS datasets.

Conclusions:

• mzRTree offers a significant improvement in managing and querying large LC-MS datasets.
• The novel data structure reduces computational complexity and enhances efficiency in MS-based proteomics data analysis.
• mzRTree is a valuable tool for the growing field of proteomics, addressing current data management challenges.