Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach

DOI10.1016/j.jda.2004.08.012zbMath1105.68027OpenAlexW2088483474MaRDI QIDQ2569412

M. C. Sobrinho, Tiago M. Fonseca, Thelmo E. S. Martins, Adilton G. Oliveira, Lorena S. Soares, Eugenia T. G. Oliveira, Maria Emilia Machado Telles Walter

Publication date: 27 October 2005

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.08.012

zbMATH Keywords

transpositiontime complexitycycle graphalgorithm of Bafna and Pevzner

Mathematics Subject Classification ID

Searching and sorting (68P10) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10) Approximation algorithms (68W25)

Related Items

Rearrangement events on circular genomes ⋮ An Audit Tool for Genome Rearrangement Algorithms

Cites Work

• Sorting permutations by block-interchanges
• A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
• Working on the Problem of Sorting by Transpositions on Genome Rearrangements
• Sorting by Transpositions
• Estendendo a Teoria de Bafna e Pevzner para o Problema da Ordenação por Transposições

This page was built for publication: Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach