Sorting Genomes with Duplications and Deletions
Author Information
Author(s): Bader Martin
Primary Institution: Institute of Theoretical Computer Science, University of Ulm
Hypothesis
Can we develop an algorithm to sort an ancestral genome into a descendant genome with arbitrary gene content using various operations?
Conclusion
The proposed algorithm effectively finds sorting sequences that approximate optimal solutions for closely related genomes, though performance decreases with greater divergence or larger genome sizes.
Supporting Evidence
- The algorithm can handle duplications and deletions of arbitrary size.
- Experimental results show that the algorithm performs well for closely related genomes.
- The quality of results decreases with increasing genome size and divergence.
Takeaway
The study created a new way to rearrange genomes that can handle duplicates and deletions, making it easier to understand how genomes evolve over time.
Methodology
A heuristic algorithm was developed to sort genomes by using reversals, block interchanges, tandem duplications, and deletions of arbitrary size.
Limitations
The algorithm's effectiveness decreases as genomes become more diverged or larger in size.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website