EUVIMEDEUVIMED entdecken
Crossref

Partition Based Algorithms for Rearrangement Distances With Flexible Intergenic Regions

Gabriel Siqueira, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Geraldine Jean, Guillaume Fertin, Zanoni Dias

IEEE Transactions on Computational Biology and Bioinformatics · 2025

DOI: 10.1109/tcbb.2024.3467033 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Computational Biology and Bioinformatics, 2025. Verfasst von Gabriel Siqueira und 5 weiteren Autor:innen. Hauptthemen laut MEDLINE: Algorithms, DNA, Intergenic, Gene Rearrangement, Genomics. Die Arbeit nennt 27 Literaturangaben.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Genome Rearrangement distance problems are used in Computational Biology to estimate the evolutionary distance between genomes. These problems consist of minimizing the number of rearrangement events necessary to transform one genome into another. Two commonly used rearrangement events are reversal and transposition. The first studied problems ignored nucleotides outside genes (called intergenic regions), or assumed that genomes have a single copy of each gene. Recent works made advancements in more general problems considering the number of nucleotides in intergenic regions, and replicated genes. Nevertheless, genomes tend to have wildly different quantities of nucleotides on their intergenic regions, which poses a problem when comparing these regions exactly. To overcome this limitation, our work considers some flexibility when matching intergenic regions that do not have the same number of nucleotides. We propose new problems seeking the minimum number of reversals, or reversals and transpositions, necessary to transform one genome into another, while considering flexible intergenic region information. We show approximations for these problems by exploring their relationship with the Signed Minimum Common Flexible Intergenic String Partition problem. We also present different heuristics for the partition problem, and conduct experimental tests on simulated genomes to assess the performance of our algorithms.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsDNA, IntergenicGene RearrangementGenomicsComputational BiologyModels, GeneticGenomeEvolution, MolecularComputer Simulation

Substanzen

DNA, Intergenic

Zitieren

APA

Siqueira, G., Alexandrino, A. O., Oliveira, A. R., Jean, G., Fertin, G., & Dias, Z. (2025). Partition Based Algorithms for Rearrangement Distances With Flexible Intergenic Regions. IEEE Transactions on Computational Biology and Bioinformatics. https://doi.org/10.1109/tcbb.2024.3467033

Vancouver

Siqueira G, Alexandrino AO, Oliveira AR, Jean G, Fertin G, Dias Z. Partition Based Algorithms for Rearrangement Distances With Flexible Intergenic Regions. IEEE Transactions on Computational Biology and Bioinformatics. 2025. doi:10.1109/tcbb.2024.3467033

BibTeX
@article{Siqueira2025,
  author = {Siqueira, Gabriel and Alexandrino, Alexsandro Oliveira and Oliveira, Andre Rodrigues and Jean, Geraldine and Fertin, Guillaume and Dias, Zanoni},
  title = {Partition Based Algorithms for Rearrangement Distances With Flexible Intergenic Regions},
  journal = {IEEE Transactions on Computational Biology and Bioinformatics},
  year = {2025},
  doi = {10.1109/tcbb.2024.3467033}
}
Kostenlos starten →