Journal ArticleDOI
The chromosome inversion problem
Reads0
Chats0
TLDR
In this article, a measure of distance between two species for the purpose of constructing a phylogenetic tree is proposed, where the data from which the distance measure is to be calculated is the order of the sequence of gene loci around a circular chromosome, and the distance between any two species is the minimum number of chromosomal inversions necessary to make the two sequences identical.About:
This article is published in Journal of Theoretical Biology.The article was published on 1982-11-07. It has received 217 citations till now. The article focuses on the topics: Measure (mathematics) & Chromosomal inversion.read more
Citations
More filters
Book
Introduction to Computational Molecular Biology
João C. Setubal,João Meidanis +1 more
TL;DR: This chapter discusses the construction of phylogenetic trees, a type of tree-building based on DNA assembly, and its applications in medicine, dentistry, and neuroscience.
Proceedings ArticleDOI
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
TL;DR: A duality theorem is proved explaining this intriguing performance and it is shown that there exists a “hidden” parameter that allows one to compute the reversal distance between signed permutations in polynomial time.
Journal ArticleDOI
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
TL;DR: Sorting of signed permutations by reversals is studied, a problem that adequately models rearrangements in a small genomes like chloroplast or mitochondrial DNA and proves a duality theorem explaining this intriguing performance.
Journal ArticleDOI
Efficient sorting of genomic permutations by translocation, inversion and block interchange
TL;DR: A universal double-cut-and-join operation that accounts for inversions, translocations, fissions and fusions, but also produces circular intermediates which can be reabsorbed, which converts one multi-linear chromosome genome to another in the minimum distance.
Journal Article
Genome-Scale Evolution: Reconstructing Gene Orders in the Ancestral Species
TL;DR: A new multiple genome rearrangement algorithm that is based on the rearrangements (rather than breakpoint) distance and that is applicable to both unichromosomal and multichromaosomal genomes is proposed and applied for genome-scale phylogenetic tree reconstruction and deriving ancestral gene orders.
References
More filters
Journal ArticleDOI
On the Theory and Computation of Evolutionary Distances
TL;DR: The algorithm, introduced here, lends itself to computer programming and provides a method to compute evolutionary distance which is shorter than the other methods currently in use.
Journal ArticleDOI
The theory and computation of evolutionary distances: Pattern recognition
TL;DR: A method of finding pattern similarities between two sequences, where two portions, one from each sequence, are similar if they are close in the metric space of evolutionary distances, lends itself to finding similarities by computer between pairs of biological sequences.
Journal ArticleDOI
An algorithm for the distance between two finite sequences
TL;DR: In a biological problem, which will be described later, it is necessary to compute the distance or degree of dissimilarity between two finite sequences, and an algorithm for computing this distance is presented here.