Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics · 2024
DOI: 10.1109/tcbb.2023.3277733 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2024. Verfasst von Joao Paulo Pereira Zanetti und 3 weiteren Autor:innen. Hauptthemen laut MEDLINE: Algorithms, Genome, Genomics. Die Arbeit nennt 34 Literaturangaben. Gefördert von: Fundação de Amparo à Pesquisa do Estado de São Paulo, Natural Sciences and Engineering Research Council of Canada, Sloan Foundation Fellowship.
Abstract (Originalsprache)
An important problem in genome comparison is the genome sorting problem, that is, the problem of finding a sequence of basic operations that transforms one genome into another whose length (possibly weighted) equals the distance between them. These sequences are called optimal sorting scenarios. However, there is usually a large number of such scenarios, and a naïve algorithm is very likely to be biased towards a specific type of scenario, impairing its usefulness in real-world applications. One way to go beyond the traditional sorting algorithms is to explore all possible solutions, looking at all the optimal sorting scenarios instead of just an arbitrary one. Another related approach is to analyze all the intermediate genomes, that is, all the genomes that can occur in an optimal sorting scenario. In this article, we show how to enumerate the optimal sorting scenarios and the intermediate genomes between any two given genomes, under the rank distance.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Förderung
- Fundação de Amparo à Pesquisa do Estado de São Paulo
- Natural Sciences and Engineering Research Council of Canada
- Sloan Foundation Fellowship
- MRC Centre for Global Infectious Disease Analysis
- Medical Research Council
- U.K. Foreign, Commonwealth & Development Office
- MRC/FCDO
Zitieren
APA
Zanetti, J. P. P., Oliveira, L. P., Meidanis, J., & Chindelevitch, L. (2024). Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance. IEEE/ACM Transactions on Computational Biology and Bioinformatics. https://doi.org/10.1109/tcbb.2023.3277733
Vancouver
Zanetti JPP, Oliveira LP, Meidanis J, Chindelevitch L. Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2024. doi:10.1109/tcbb.2023.3277733
BibTeX
@article{Zanetti2024,
author = {Zanetti, Joao Paulo Pereira and Oliveira, Lucas Peres and Meidanis, Joao and Chindelevitch, Leonid},
title = {Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance},
journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics},
year = {2024},
doi = {10.1109/tcbb.2023.3277733}
}
EUVIMED