Approximation Algorithms for Sorting <i>λ</i>-Permutations by <i>λ</i>-Operations

Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the smallest number of rearrangements needed to transf...

Full description

Bibliographic Details

Published in:	Algorithms
Main Authors:	Guilherme Henrique Santos Miranda, Alexsandro Oliveira Alexandrino, Carla Negri Lintzmayer, Zanoni Dias
Format:	Article
Language:	English
Published:	MDPI AG 2021-06-01
Subjects:	genome rearrangements approximation algorithms sorting permutations
Online Access:	https://www.mdpi.com/1999-4893/14/6/175