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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of combinatorial optimization Ročník 46; číslo 2; s. 16
Hlavní autori:	Siqueira, Gabriel, Alexandrino, Alexsandro Oliveira, Dias, Zanoni
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.09.2023 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!