Clustering Molecular Sequences Using c-Max-Tolerance Graphs
Author Information
Author(s): Lehmann Katharina A, Kaufmann Michael, Steigele Stephan, Nieselt Kay
Primary Institution: University of Tuebingen
Hypothesis
Can we efficiently cluster molecular sequences by finding maximal cliques in c-max-tolerance graphs?
Conclusion
The proposed algorithms for finding maximal cliques in c-max-tolerance graphs significantly improve clustering efficiency for biological data sets.
Supporting Evidence
- The algorithms were tested on both artificial and biological data sets, showing significant improvements in runtime compared to existing methods.
- Results indicated that the new clustering method could handle large data sets efficiently.
- The study provides a heuristic for partitioning sequences based on maximal cliques, enhancing biological data analysis.
Takeaway
This study introduces a new way to group similar DNA or protein sequences automatically, making it easier to analyze them.
Methodology
The study presents two algorithms for finding maximal cliques in c-max-tolerance graphs, one simpler and one more efficient, and tests them on artificial and biological data sets.
Limitations
The algorithms may not perform optimally for all types of data sets, particularly those with unique clustering requirements.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website