Signed rearrangement distances considering repeated genes, intergenic regions, and indels

Genome rearrangement distance problems allow to estimate the evolutionary distance between genomes. These problems aim to compute the minimum number of mutations called rearrangement events necessary to transform one genome into another. Two commonly studied rearrangements are the reversal, which in...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 46; no. 2; p. 16
Main Authors:	Siqueira, Gabriel, Alexandrino, Alexsandro Oliveira, Dias, Zanoni
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2023 Springer Nature B.V
Subjects:	Algorithms Approximation Combinatorics Convex and Discrete Geometry Genes Genetic engineering Genomes Genomics Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Nucleotides Operations Research/Decision Theory Optimization Theory of Computation G.1.2 G.2.1 Reversal Transposition Intergenic regions Genome rearrangement
ISSN:	1382-6905, 1573-2886
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!