Efficient Algorithms for Finding the Closest $l$l-Mers in Biological Data.

Area of Science:

• Bioinformatics
• Computational Biology
• Genomics

Background:

• Next-generation sequencing generates vast biological data, necessitating efficient algorithms for information extraction.
• Identifying patterns, such as the closest l-mers, is fundamental for analyzing large biological datasets.

Purpose of the Study:

• To develop novel algorithms for finding the closest l-mers across multiple biological strings.
• To address the challenge of minimizing Hamming distance among selected l-mers from different sequences.

Main Methods:

• Focus on the fundamental problem of finding the closest l-mers within a set of m biological strings.
• Propose novel algorithms specifically designed for this closest l-mer problem.
• Conduct comprehensive experimental evaluations for m=3, and empirical studies for m=4 and m=5.

Main Results:

• The study introduces new algorithmic approaches for the closest l-mer problem.
• Experimental results validate the performance of the proposed algorithms, particularly for small values of m.

Conclusions:

• The developed algorithms offer effective solutions for extracting crucial information from large biological datasets.
• These methods have direct applications in areas like motif search and the (l,d)-motif search problem.