Efficient algorithms for multichromosomal genome rearrangements.
type: Item
instance of: scholarly article
title: Efficient algorithms for multichromosomal genome rearrangements.
zbMATH Open document ID: 1059.68160
DOI: 10.1016/S0022-0000(02)00011-9
author: Glenn Tesler
published in: Journal of Computer and System Sciences
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 92D10
zbMATH DE Number: 1910851
zbMATH Keywords: Genome rearrangements
zbMATH Keywords: Fusion
zbMATH Keywords: Fission
zbMATH Keywords: Translocation
zbMATH Keywords: Reversal
zbMATH Keywords: Inversion
zbMATH Keywords: Breakpoint graph
zbMATH Keywords: Genes
zbMATH Keywords: Chromosomes
zbMATH Keywords: Homology
MaRDI profile type: Publication
cites work: Q4252743
cites work: Transforming cabbage into turnip
cites work: A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
cites work: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
cites work: Q4526776
full work available at URL: s0022-0000(02)00011-9
OpenAlex ID: W2113035810
description: scientific article; zbMATH DE number 1910851