[图书][B] Combinatorics of genome rearrangements
G Fertin - 2009 - books.google.com
A comprehensive survey of a rapidly expanding field of combinatorial optimization,
mathematically oriented but offering biological explanations when required. From one cell to …
mathematically oriented but offering biological explanations when required. From one cell to …
New approaches for reconstructing phylogenies from gene order data
We report on new techniques we have developed for reconstructing phylogenies on whole
genomes. Our mathematical techniques include new polynomial-time methods for bounding …
genomes. Our mathematical techniques include new polynomial-time methods for bounding …
Advances in phylogeny reconstruction from gene order and content data
Genomes can be viewed in terms of their gene content and the order in which the genes
appear along each chromosome. Evolutionary events that affect the gene order or content …
appear along each chromosome. Evolutionary events that affect the gene order or content …
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
T Hartman, R Shamir - Information and Computation, 2006 - Elsevier
An important problem in genome rearrangements is sorting permutations by transpositions.
The complexity of the problem is still open, and two rather complicated 1.5-approximation …
The complexity of the problem is still open, and two rather complicated 1.5-approximation …
Sorting by prefix transpositions
Z Dias, J Meidanis - International Symposium on String Processing and …, 2002 - Springer
A transposition is an operation that exchanges two consecutive, adjacent blocks in a
permutation. A prefix transposition is a transposition that moves the first element in the …
permutation. A prefix transposition is a transposition that moves the first element in the …
Reversals and transpositions over finite alphabets
AJ Radcliffe, AD Scott, EL Wilmer - SIAM journal on discrete mathematics, 2005 - SIAM
Extending results of Christie and Irving, we examine the action of reversals and
transpositions on finite strings over an alphabet of size k. We show that determining reversal …
transpositions on finite strings over an alphabet of size k. We show that determining reversal …
A simpler 1.5-approximation algorithm for sorting by transpositions
T Hartman - … Pattern Matching: 14th Annual Symposium, CPM 2003 …, 2003 - Springer
An important problem in genome rearrangements is sorting permutations by transpositions.
Its complexity is still open, and two rather complicated 1.5-approximation algorithms for …
Its complexity is still open, and two rather complicated 1.5-approximation algorithms for …
A 1.5-approximation algorithm for sorting by transpositions and transreversals
T Hartman, R Sharan - Journal of Computer and System Sciences, 2005 - Elsevier
One of the most promising ways to determine evolutionary distance between two organisms
is to compare the order of appearance of orthologous genes in their genomes. The resulting …
is to compare the order of appearance of orthologous genes in their genomes. The resulting …
Computing the inversion-indel distance
The inversion distance, that is the distance between two unichromosomal genomes with the
same content allowing only inversions of DNA segments, can be exactly computed thanks to …
same content allowing only inversions of DNA segments, can be exactly computed thanks to …
On the inversion-indel distance
Background The inversion distance, that is the distance between two unichromosomal
genomes with the same content allowing only inversions of DNA segments, can be …
genomes with the same content allowing only inversions of DNA segments, can be …