Genome rearrangements: a correct algorithm for optimal capping
JEAN, Géraldine
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Models and Algorithms for the Genome [MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Models and Algorithms for the Genome [MAGNOME]
NIKOLSKI, Macha
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Models and Algorithms for the Genome [MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Models and Algorithms for the Genome [MAGNOME]
JEAN, Géraldine
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Models and Algorithms for the Genome [MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Models and Algorithms for the Genome [MAGNOME]
NIKOLSKI, Macha
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Models and Algorithms for the Genome [MAGNOME]
< Reduce
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Models and Algorithms for the Genome [MAGNOME]
Language
en
Article de revue
This item was published in
Information Processing Letters. 2007, vol. 104, n° 1, p. 14-20
Elsevier
English Abstract
In this Letter we propose two results in application to rearrangements of multichromosomal genomes: first, a literature synthesis providing a classification for breakpoint graph components; and second, a new algorithm for ...Read more >
In this Letter we propose two results in application to rearrangements of multichromosomal genomes: first, a literature synthesis providing a classification for breakpoint graph components; and second, a new algorithm for optimal capping with a proof of its correction.Read less <
English Keywords
Algorithms
Genome rearrangements
Breakpoint graph
Genomic distance
Optimal capping
Origin
Hal imported