BOOL-AN: a method for comparative sequence analysis and phylogenetic reconstruction

Area of Science:

• Computational Biology
• Bioinformatics
• Evolutionary Biology

Background:

• Molecular systematics traditionally relies on statistical models of evolution.
• Existing methods may require specific assumptions about evolutionary processes.
• A need exists for alternative, assumption-free approaches to phylogenetic inference.

Purpose of the Study:

• To introduce a novel discrete mathematical approach for molecular systematics.
• To develop a method that does not require prior statistical assumptions about the evolutionary process.
• To provide a new tool for inferring phylogenetic trees from molecular sequence data.

Main Methods:

• Algorithms generate mathematical representations directly from DNA/RNA or protein sequences.
• Binary encoded sequence data is transformed into the Iterative Canonical Form (ICF) of Boolean functions.
• The ICF serves as a generalized molecular descriptor, yielding vector data for distance matrix calculation and phylogenetic analysis (e.g., neighbor-joining, UPGMA, principal coordinates analysis).

Main Results:

• The Boolean analysis (BOOL-AN) method successfully generates phylogenetic trees and ordination scattergrams.
• The approach provides numerical and visual characteristics from sequence data.
• It offers a generalized molecular descriptor (ICF) for comparative analysis.

Conclusions:

• Boolean analysis (BOOL-AN) presents a robust, assumption-free discrete mathematical framework for molecular systematics.
• This method enhances phylogenetic inference by offering a novel computational tool.
• BOOL-AN provides a versatile approach for analyzing molecular sequence data in evolutionary studies.