Skip to Main content Skip to Navigation
Journal articles

Genome rearrangements: a correct algorithm for optimal capping

Géraldine Jean 1, 2 Macha Nikolski 1, 2 
1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 MAGNOME - Models and Algorithms for the Genome
INRIA Futurs, Université Sciences et Technologies - Bordeaux 1, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
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 optimal capping with a proof of its correction.
Keywords : Algorithms Genome rearrangements Breakpoint graph Genomic distance Optimal capping
Document type :
Journal articles
Complete list of metadata
https://hal.inria.fr/inria-00274291
Contributor : David James Sherman Connect in order to contact the contributor
Submitted on : Thursday, April 17, 2008 - 4:58:58 PM
Last modification on : Saturday, June 25, 2022 - 7:44:13 PM

Links full text

istex

Identifiers

Collections

CNRS | INRIA | LABRI | LABRI-MABIOVIS | INRIA2

Citation

Géraldine Jean, Macha Nikolski. Genome rearrangements: a correct algorithm for optimal capping. Information Processing Letters, Elsevier, 2007, 104 (1), pp.14-20. ⟨10.1016/j.ipl.2007.04.011⟩. ⟨inria-00274291⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

74

 

Contact                    Legal Notice                    Personal Data