Variable depth recursion algorithm for leaf sequencing

Area of Science:

• Computational Biology
• Bioinformatics
• Algorithm Development

Background:

• Leaf sequencing algorithms utilize extraction and sweep as fundamental segmentation steps.
• Previous modifications to commercial leaf sequencers improved solution quality but increased computation time.
• Existing algorithms evaluated multiple solutions, each with up to 12 extracts and a sweep sequence.

Purpose of the Study:

• To develop a faster and more efficient leaf sequencing algorithm.
• To achieve comparable or superior solution quality to existing methods with reduced computational cost.
• To compare the performance of the new algorithm against commercial and published leaf sequencing algorithms.

Main Methods:

• A novel algorithm was developed that selects one extract at a time.
• The new algorithm iteratively calls itself as an evaluation function a user-specified number of times.
• The bidirectional sweeping window algorithm serves as the final evaluation function.
• Performance was evaluated on clinical test maps and random test maps with varying intensity levels.

Main Results:

• The new algorithm achieved computation speeds 12-43 times faster on clinical test maps.
• 2-3 calls to the evaluation function were sufficient for performance comparable to modified commercial sequencers.
• The algorithm consistently provided the best solutions across all tested clinical and random maps.
• Slight improvements in solution quality were observed beyond two calls to the evaluation function.

Conclusions:

• The new leaf sequencing algorithm offers a significant speed improvement over existing methods.
• It maintains or surpasses the solution quality of previous algorithms, including commercial versions.
• The algorithm's efficiency makes it a valuable tool for complex segmentation tasks in leaf sequencing.