EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order

Area of Science:

• Computational biology
• Bioinformatics
• Genomics

Background:

• Comparing and modeling incomplete permutations is computationally challenging.
• This problem has significant practical implications in bioinformatics and social sciences.
• Existing distance measures may not effectively handle missing data in permutations.

Purpose of the Study:

• To extend distance measures for permutations to accommodate incomplete permutations.
• To develop an efficient computational method for comparing incomplete permutations.
• To apply the novel method to a real-world classification problem.

Main Methods:

• Developed a novel distance measure for incomplete permutations.
• Derived a closed-form expression for the proposed distance.
• Implemented an efficient algorithm for computing the distance on large datasets with missing elements.

Main Results:

• The proposed distance measure effectively supports incomplete permutations.
• The method allows for efficient computation even with multiple missing elements.
• Demonstrated successful application in classifying bacteria based on gene order.

Conclusions:

• The novel distance measure provides a computationally efficient solution for analyzing incomplete permutations.
• This advancement is valuable for applications requiring the comparison of partial or missing sequence data.
• The method shows promise for improving classification accuracy in biological and social science domains.